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 20:29Victor MerckléVictor MerckléScore: 2,556Success
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 20:302,54429,358,53720,865,000024,576stderr
2Sep 8, 2026 20:302,55029,168,45120,911,000024,576stderr
3Sep 8, 2026 20:302,55129,371,17020,923,000024,576stderr
4Sep 8, 2026 20:302,55329,201,50420,936,000024,576stderr
5Sep 8, 2026 20:302,55629,200,09520,966,000024,576stderr
6Sep 8, 2026 20:302,56029,247,99020,994,000024,576stderr
7Sep 8, 2026 20:302,56729,371,45920,008,0001,044,00024,576stderr
8Sep 8, 2026 20:302,63129,830,33021,577,000024,576stderr
9Sep 8, 2026 20:302,63630,105,62221,622,000024,576stderr