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:14Victor MerckléVictor MerckléScore: 11,994Success
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:153,01932,390,44923,645,0001,116,0002,113,536
2Jun 23, 2026 21:153,05932,713,99723,870,0001,217,0002,113,536
3Jun 23, 2026 21:153,08032,859,21824,064,0001,199,0002,113,536
4Jun 23, 2026 21:153,10133,296,48024,228,0001,201,0002,113,536
5Jun 23, 2026 21:1511,994105,967,05397,343,0001,009,0002,113,536
6Jun 23, 2026 21:1512,008106,122,42797,461,0001,008,0002,113,536
7Jun 23, 2026 21:1512,593110,875,995102,262,0001,008,0002,113,536
8Jun 23, 2026 21:1512,679111,578,718102,962,0001,007,0002,113,536
9Jun 23, 2026 21:1512,738112,156,549103,444,0001,011,0002,113,536