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 18:56Victor 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 18:572,55829,505,01720,980,000024,576stderr
2Sep 8, 2026 18:572,55929,466,38520,984,000024,576stderr
3Sep 8, 2026 18:572,55930,654,37720,987,000024,576stderr
4Sep 8, 2026 18:572,56529,516,79621,040,000024,576stderr
5Sep 8, 2026 18:572,56729,582,27720,028,0001,023,00024,576stderr
6Sep 8, 2026 18:572,57329,559,72521,106,000024,576stderr
7Sep 8, 2026 18:572,65430,928,41821,768,000024,576stderr
8Sep 8, 2026 18:572,67231,061,34921,915,000024,576stderr
9Sep 8, 2026 18:575,45753,791,87843,732,0001,018,00024,576stderr