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 listAug 18, 2026 14:22Victor MerckléVictor MerckléScore: 12,922Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2026 14:243,37236,132,52925,601,0002,055,0002,142,208stderr
2Aug 18, 2026 14:243,39436,207,12525,743,0002,095,0002,142,208stderr
3Aug 18, 2026 14:243,40536,373,70525,874,0002,054,0002,142,208stderr
4Aug 18, 2026 14:243,42336,675,52625,985,0002,084,0002,142,208stderr
5Aug 18, 2026 14:2412,922114,455,562103,887,0002,078,0002,142,208stderr
6Aug 18, 2026 14:2412,978114,914,591104,406,0002,019,0002,142,208stderr
7Aug 18, 2026 14:2413,013115,038,332104,603,0002,104,0002,142,208stderr
8Aug 18, 2026 14:2413,020115,055,069104,705,0002,066,0002,142,208stderr
9Aug 18, 2026 14:2413,032115,318,692104,683,0002,181,0002,142,208stderr