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 17:43Victor MerckléVictor MerckléScore: 2,567Success
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 17:512,55129,283,93920,924,000024,576stderr
2Sep 8, 2026 17:512,55329,668,31820,940,000024,576stderr
3Sep 8, 2026 17:512,55529,600,57020,956,000024,576stderr
4Sep 8, 2026 17:512,56429,321,86221,027,000024,576stderr
5Sep 8, 2026 17:512,56729,524,76821,051,000024,576stderr
6Sep 8, 2026 17:512,59029,474,24620,171,0001,072,00024,576stderr
7Sep 8, 2026 17:512,63429,847,94121,601,000024,576stderr
8Sep 8, 2026 17:512,64230,001,72921,672,000024,576stderr
9Sep 8, 2026 17:515,43453,711,88443,552,0001,014,00024,576stderr