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 19, 2026 09:56Victor MerckléVictor MerckléScore: 3,035Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2026 09:572,97033,407,72823,280,0001,082,0002,117,632stderr
2Aug 19, 2026 09:572,99133,573,46323,487,0001,041,0002,117,632stderr
3Aug 19, 2026 09:573,01532,950,06923,690,0001,039,0002,117,632stderr
4Aug 19, 2026 09:573,02033,167,68523,726,0001,040,0002,117,632stderr
5Aug 19, 2026 09:573,03540,922,78523,807,0001,087,0002,117,632stderr
6Aug 19, 2026 09:573,03933,049,03623,866,0001,056,0002,117,632stderr
7Aug 19, 2026 09:573,06733,381,74624,098,0001,055,0002,117,632stderr
8Aug 19, 2026 09:573,07833,644,57023,174,0002,067,0002,117,632stderr
9Aug 19, 2026 09:573,09834,789,56223,344,0002,063,0002,117,632stderr