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 listJun 23, 2026 23:11Victor MerckléVictor MerckléScore: 3,079Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 23:123,02832,435,72423,706,0001,124,0002,117,632stderr
2Jun 23, 2026 23:123,04332,516,75223,765,0001,189,0002,117,632stderr
3Jun 23, 2026 23:123,06932,748,65323,947,0001,222,0002,117,632stderr
4Jun 23, 2026 23:123,07732,904,47724,113,0001,122,0002,117,632stderr
5Jun 23, 2026 23:123,07933,243,64524,039,0001,214,0002,117,632stderr
6Jun 23, 2026 23:1212,055106,450,88397,846,0001,010,0002,117,632stderr
7Jun 23, 2026 23:1212,058106,461,73697,871,0001,009,0002,117,632stderr
8Jun 23, 2026 23:1212,611111,038,989102,406,0001,009,0002,117,632stderr
9Jun 23, 2026 23:1212,627111,189,500102,529,0001,015,0002,117,632stderr