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 4, 2026 05:03Victor MerckléVictor MerckléScore: 3,351Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 05:043,04032,894,35823,730,0001,199,0002,117,632stderr
2Jul 4, 2026 05:043,08633,259,14624,266,0001,046,0002,117,632stderr
3Jul 4, 2026 05:043,09633,709,50124,130,0001,264,0002,117,632stderr
4Jul 4, 2026 05:043,32435,179,91626,216,0001,043,0002,117,632stderr
5Jul 4, 2026 05:043,35135,395,59026,457,0001,026,0002,117,632stderr
6Jul 4, 2026 05:0411,876105,342,52196,375,0001,016,0002,117,632stderr
7Jul 4, 2026 05:0411,976106,179,03197,202,0001,009,0002,117,632stderr
8Jul 4, 2026 05:0412,026106,574,66897,600,0001,015,0002,117,632stderr
9Jul 4, 2026 05:0412,054106,774,01897,831,0001,012,0002,117,632stderr