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 listSep 8, 2026 09:29Victor MerckléVictor MerckléScore: 2,602Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 09:312,59030,388,26921,243,000024,576stderr
2Sep 8, 2026 09:312,59429,769,75521,277,000024,576stderr
3Sep 8, 2026 09:312,59629,651,96321,295,000024,576stderr
4Sep 8, 2026 09:312,59629,632,27321,292,000024,576stderr
5Sep 8, 2026 09:312,60229,485,88721,337,000024,576stderr
6Sep 8, 2026 09:312,60329,686,17321,346,000024,576stderr
7Sep 8, 2026 09:312,60429,605,00421,354,000024,576stderr
8Sep 8, 2026 09:315,34151,957,24542,786,0001,015,00024,576stderr
9Sep 8, 2026 09:315,35852,123,92442,921,0001,015,00024,576stderr