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 22, 2026 00:00M-RochatM-RochatScore: 7,944Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 00:017,69573,113,06060,067,0003,040,0002,113,536
2May 22, 2026 00:017,82573,820,76461,110,0003,063,0002,113,536
3May 22, 2026 00:017,86373,822,33861,450,0003,031,0002,113,536
4May 22, 2026 00:017,94474,720,50662,084,0003,063,0002,113,536
5May 22, 2026 00:017,94474,535,39362,087,0003,056,0002,113,536
6May 22, 2026 00:0119,881172,394,611158,829,0004,198,0002,113,536
7May 22, 2026 00:0119,886173,038,825158,772,0004,296,0002,113,536
8May 22, 2026 00:0119,916174,749,107158,972,0004,342,0002,113,536
9May 22, 2026 00:0120,058175,349,808160,246,0004,236,0002,113,536