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 listMar 12, 2026 20:16Josu San MartinJosu San MartinScore: 17,770Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 12, 2026 20:163,31252,033,79925,147,0002,011,0002,457,600
2Mar 12, 2026 20:163,31656,316,08025,175,0002,014,0002,424,832
3Mar 12, 2026 20:163,33654,817,03826,339,0001,013,0002,363,392
4Mar 12, 2026 20:1617,525169,031,432141,707,0001,995,0002,367,488
5Mar 12, 2026 20:1617,770175,570,285141,726,0003,992,0002,347,008
6Mar 12, 2026 20:1617,862169,939,620145,468,0001,003,0002,514,944
7Mar 12, 2026 20:1617,923174,313,343144,972,0001,999,0002,514,944
8Mar 12, 2026 20:1618,206169,058,846147,287,0002,003,0002,375,680
9Mar 12, 2026 20:1618,436174,024,906149,175,0002,002,0002,424,832