Brainfuckbrainfuck, 162 bytes
>+[+[>+<+<]>]+[,[>[>+<<->-]<[>>>+<<<-]>>>>+<<[<+>-]<<+>>]<<]>>>[-]>>[<+>-]<[->+>-[>+>>]>[+[-<+>]>+>>]<<<<<<]>[-]+++++++>[-]<[>+++++++<-]>>[<.[-]>[-]>[-]]<[-.[-]]
outputs 0
for truthy and 1
for falsey
This one was a lot of fun. Not necessary golf-optimal but hey, brainfuck solution :)
Explanation
; 96 algorithm from esolangs constants
; initialise tape to (1)/96/0/0/0
>+[+[>+<+<]>]+[
; while(getchar())
,[>
[>+<<->-]
<[>>>+<<<-]>>>>+<<[<+>-]<<+>>
; 0/96/(0)/cumulative/length
]
<<
]
; divmod algorithm from esolangs
>>>[-]>>[<+>-]
<[->+>-[>+>>]>[+[-<+>]>+>>]<<<<<<]
; prepare 0 for output
>[-]+++++++>[-]<[>+++++++<-]
; if(sum%length){print 1}else{print 0}
>>[<.[-]>[-]>[-]]<[-.[-]]