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 16, 2026 19:55M-RochatM-RochatScore: 13,651Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 19:5813,635120,607,832109,777,0002,035,0002,113,536
2May 16, 2026 19:5813,636123,221,293109,762,0002,059,0002,113,536
3May 16, 2026 19:5813,636120,915,947109,726,0002,094,0002,113,536
4May 16, 2026 19:5813,638121,887,339109,742,0002,097,0002,113,536
5May 16, 2026 19:5813,651120,759,476109,847,0002,093,0002,113,536
6May 16, 2026 19:5813,653120,777,514109,927,0002,034,0002,113,536
7May 16, 2026 19:5813,675120,902,725110,050,0002,091,0002,113,536
8May 16, 2026 19:5813,703121,247,044110,301,0002,069,0002,113,536
9May 16, 2026 19:5813,715121,255,565110,310,0002,154,0002,113,536