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 2, 2026 00:34Victor MerckléVictor MerckléScore: 3,098Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 00:353,02532,732,06523,603,0001,202,0002,117,632stderr
2Jul 2, 2026 00:353,03732,854,92023,728,0001,183,0002,117,632stderr
3Jul 2, 2026 00:353,04333,160,86423,740,0001,216,0002,117,632stderr
4Jul 2, 2026 00:353,07933,208,86024,001,0001,251,0002,117,632stderr
5Jul 2, 2026 00:353,09833,663,73124,199,0001,210,0002,117,632stderr
6Jul 2, 2026 00:353,28735,079,09425,924,0001,031,0002,117,632stderr
7Jul 2, 2026 00:3512,004106,344,73397,425,0001,009,0002,117,632stderr
8Jul 2, 2026 00:3512,024106,495,92097,593,0001,008,0002,117,632stderr
9Jul 2, 2026 00:3512,734112,506,902103,416,0001,008,0002,117,632stderr