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 listSep 4, 2026 00:01Josu San MartinJosu San MartinScore: 3,052Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 00:013,03334,774,16723,841,0001,032,0002,121,728stderr
2Sep 4, 2026 00:013,03934,823,23223,899,0001,026,0002,121,728stderr
3Sep 4, 2026 00:013,04334,944,49723,929,0001,026,0002,121,728stderr
4Sep 4, 2026 00:013,05034,929,14823,990,0001,022,0002,121,728stderr
5Sep 4, 2026 00:013,05235,007,67923,989,0001,038,0002,121,728stderr
6Sep 4, 2026 00:013,06035,131,93923,885,0001,212,0002,121,728stderr
7Sep 4, 2026 00:013,07335,165,40924,177,0001,024,0002,121,728stderr
8Sep 4, 2026 00:013,09236,171,62624,319,0001,039,0002,121,728stderr
9Sep 4, 2026 00:0115,294135,448,217124,399,0001,013,0002,121,728stderr