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 3, 2026 06:03Josu San MartinJosu San MartinScore: 11,429Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 06:043,32237,197,95126,183,0001,058,0002,117,632
2Sep 3, 2026 06:043,33137,312,03526,276,0001,041,0002,117,632
3Sep 3, 2026 06:043,33537,950,24526,287,0001,060,0002,117,632
4Sep 3, 2026 06:043,36538,263,32426,530,0001,063,0002,117,632
5Sep 3, 2026 06:0411,429103,715,01392,709,0001,010,0002,117,632
6Sep 3, 2026 06:0411,432105,000,48592,734,0001,010,0002,117,632
7Sep 3, 2026 06:0411,438103,766,40792,784,0001,011,0002,117,632
8Sep 3, 2026 06:0411,448103,910,18892,871,0001,010,0002,117,632
9Sep 3, 2026 06:0411,649106,379,00694,514,0001,010,0002,117,632