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 listMay 11, 2026 18:11Victor MerckléVictor MerckléScore: 3,535Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 18:123,47038,081,66927,408,0001,050,0002,113,536
2May 11, 2026 18:123,48137,325,77027,498,0001,053,0002,113,536
3May 11, 2026 18:123,49937,697,14427,665,0001,032,0002,113,536
4May 11, 2026 18:123,52239,129,12827,820,0001,068,0002,113,536
5May 11, 2026 18:123,53538,746,95927,931,0001,059,0002,113,536
6May 11, 2026 18:123,55040,580,26128,050,0001,068,0002,113,536
7May 11, 2026 18:123,58440,239,64827,375,0002,021,0002,113,536
8May 11, 2026 18:1238,891327,662,429316,908,0002,005,0002,113,536
9May 11, 2026 18:1239,336332,181,139320,544,0002,013,0002,113,536