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 listJul 14, 2026 19:20Victor MerckléVictor MerckléScore: 11,848Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 19:2111,786104,472,40695,523,0001,127,0002,117,632stderr
2Jul 14, 2026 19:2111,816104,700,93095,758,0001,135,0002,117,632stderr
3Jul 14, 2026 19:2111,833104,862,98595,913,0001,120,0002,117,632stderr
4Jul 14, 2026 19:2111,844105,073,20895,986,0001,140,0002,117,632stderr
5Jul 14, 2026 19:2111,848105,098,39296,114,0001,044,0002,117,632stderr
6Jul 14, 2026 19:2111,849105,112,43796,058,0001,108,0002,117,632stderr
7Jul 14, 2026 19:2111,868105,202,60296,188,0001,132,0002,117,632stderr
8Jul 14, 2026 19:2111,913106,290,87496,551,0001,138,0002,117,632stderr
9Jul 14, 2026 19:2111,915105,700,09196,668,0001,035,0002,117,632stderr