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 17, 2026 04:27M-RochatM-RochatScore: 10,340Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 04:2810,19492,484,07577,222,0006,373,0002,113,536
2May 17, 2026 04:2810,19893,831,94977,160,0006,469,0002,113,536
3May 17, 2026 04:2810,24092,706,65577,392,0006,584,0002,113,536
4May 17, 2026 04:2810,30395,940,65378,236,0006,255,0002,113,536
5May 17, 2026 04:2810,34093,593,88478,290,0006,499,0002,113,536
6May 17, 2026 04:2810,46794,696,90279,313,0006,518,0002,113,536
7May 17, 2026 04:2810,47894,804,17979,330,0006,595,0002,113,536
8May 17, 2026 04:2822,304191,750,753175,158,0007,741,0002,117,632
9May 17, 2026 04:2822,549193,705,447177,571,0007,332,0002,117,632