Median Sergey Svistunov

Find the median of a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The median value, printed as a decimal string. The median is defined as the element at index N/2 (i.e., a[50000000]) in the sorted array.

Back to listAug 17, 2026 11:49Tomislav TunkovicTomislav TunkovicScore: 2,807Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 11:522,76931,147,25521,630,0001,081,0002,121,728
2Aug 17, 2026 11:522,77831,330,55921,657,0001,128,0002,121,728
3Aug 17, 2026 11:522,77931,355,84521,657,0001,131,0002,121,728
4Aug 17, 2026 11:522,78331,290,90521,746,0001,076,0002,121,728
5Aug 17, 2026 11:522,80731,487,59821,860,0001,158,0002,121,728
6Aug 17, 2026 11:522,94843,683,19022,984,0001,195,0002,121,728
7Aug 17, 2026 11:525,51053,690,63544,074,0001,113,0002,121,728
8Aug 17, 2026 11:525,51153,721,07344,088,0001,108,0002,121,728
9Aug 17, 2026 11:525,52653,805,83744,247,0001,068,0002,121,728