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 21:45M-RochatM-RochatScore: 17,444Success
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 21:5217,254151,332,369135,690,0005,793,0002,117,632
2May 16, 2026 21:5217,264150,400,151134,900,0006,667,0002,117,632
3May 16, 2026 21:5217,354151,108,683135,320,0006,990,0002,113,536
4May 16, 2026 21:5217,363151,695,489136,495,0005,886,0002,117,632
5May 16, 2026 21:5217,444151,838,337137,222,0005,825,0002,113,536
6May 16, 2026 21:5217,493152,181,288136,745,0006,698,0002,117,632
7May 16, 2026 21:5217,585153,040,250137,653,0006,551,0002,117,632
8May 16, 2026 21:5217,605153,355,878137,827,0006,542,0002,117,632
9May 16, 2026 21:5217,641153,448,473138,350,0006,308,0002,113,536