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 14, 2026 23:17Tomislav TunkovicTomislav TunkovicScore: 2,891Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 23:182,87332,041,21822,475,0001,088,0002,117,632stderr
2Aug 14, 2026 23:182,87932,635,17522,501,0001,113,0002,117,632stderr
3Aug 14, 2026 23:182,88432,783,59922,623,0001,026,0002,117,632stderr
4Aug 14, 2026 23:182,88632,115,18222,607,0001,059,0002,117,632stderr
5Aug 14, 2026 23:182,89132,187,03622,608,0001,103,0002,117,632stderr
6Aug 14, 2026 23:182,89832,217,91822,712,0001,057,0002,117,632stderr
7Aug 14, 2026 23:182,90432,322,79222,752,0001,062,0002,117,632stderr
8Aug 14, 2026 23:182,90632,335,92022,776,0001,061,0002,117,632stderr
9Aug 14, 2026 23:182,90732,372,76122,741,0001,098,0002,117,632stderr