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 9, 2026 06:48Victor MerckléVictor MerckléScore: 2,890Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 06:492,87231,513,13122,443,0001,108,0002,117,632stderr
2Jul 9, 2026 06:492,87331,545,23322,448,0001,114,0002,117,632stderr
3Jul 9, 2026 06:492,88031,799,11322,595,0001,029,0002,117,632stderr
4Jul 9, 2026 06:492,88931,725,54222,591,0001,104,0002,117,632stderr
5Jul 9, 2026 06:492,89031,653,10322,584,0001,114,0002,117,632stderr
6Jul 9, 2026 06:492,92632,016,74422,968,0001,027,0002,117,632stderr
7Jul 9, 2026 06:492,93632,157,13323,026,0001,050,0002,117,632stderr
8Jul 9, 2026 06:492,93632,158,65023,068,0001,014,0002,117,632stderr
9Jul 9, 2026 06:4912,058106,936,16497,870,0001,008,0002,117,632stderr