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 21:29Victor MerckléVictor MerckléScore: 11,947Success
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 21:303,04632,788,54123,759,0001,222,0002,117,632stderr
2Jun 23, 2026 21:303,08932,944,90024,117,0001,216,0002,117,632stderr
3Jun 23, 2026 21:303,10733,111,41624,257,0001,227,0002,117,632stderr
4Jun 23, 2026 21:3011,920105,368,73196,735,0001,009,0002,117,632stderr
5Jun 23, 2026 21:3011,947105,584,70996,963,0001,008,0002,117,632stderr
6Jun 23, 2026 21:3011,963105,691,95797,092,0001,008,0002,117,632stderr
7Jun 23, 2026 21:3011,969105,807,96797,141,0001,008,0002,117,632stderr
8Jun 23, 2026 21:3012,028106,378,83997,625,0001,009,0002,117,632stderr
9Jun 23, 2026 21:3012,101106,868,06298,221,0001,013,0002,117,632stderr