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 17, 2026 19:03Maya RebholzMaya RebholzScore: 10,259Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 19:049,78889,486,22878,052,0002,215,0002,113,536
2Jun 17, 2026 19:049,98991,223,21478,536,0003,380,0002,113,536
3Jun 17, 2026 19:0410,06191,735,34079,275,0003,231,0002,113,536
4Jun 17, 2026 19:0410,15892,505,09880,012,0003,288,0002,113,536
5Jun 17, 2026 19:0410,25993,723,57381,909,0002,216,0002,113,536
6Jun 17, 2026 19:0410,34894,273,23082,638,0002,218,0002,113,536
7Jun 17, 2026 19:0410,42794,789,48282,282,0003,225,0002,113,536
8Jun 17, 2026 19:0410,69696,956,25884,418,0003,296,0002,113,536
9Jun 17, 2026 19:0410,73097,265,49484,544,0003,442,0002,113,536