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 listJul 9, 2026 06:59Victor MerckléVictor MerckléScore: 9,261Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 07:009,17083,123,93774,100,0001,101,0002,117,632stderr
2Jul 9, 2026 07:009,18883,357,85374,337,0001,006,0002,117,632stderr
3Jul 9, 2026 07:009,23883,761,49674,737,0001,019,0002,117,632stderr
4Jul 9, 2026 07:009,24883,895,59774,747,0001,092,0002,117,632stderr
5Jul 9, 2026 07:009,26183,818,86374,817,0001,127,0002,117,632stderr
6Jul 9, 2026 07:009,28683,953,40875,056,0001,090,0002,117,632stderr
7Jul 9, 2026 07:0018,032156,338,460146,730,0001,134,0002,117,632stderr
8Jul 9, 2026 07:0018,032155,792,115146,741,0001,124,0002,117,632stderr
9Jul 9, 2026 07:0018,168156,778,508147,937,0001,043,0002,117,632stderr