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 07:11Victor MerckléVictor MerckléScore: 2,598Success
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 07:122,59129,779,99321,247,000024,576stderr
2Sep 8, 2026 07:122,59430,458,26020,237,0001,038,00024,576stderr
3Sep 8, 2026 07:122,59429,581,17221,275,000024,576stderr
4Sep 8, 2026 07:122,59829,569,69921,308,000024,576stderr
5Sep 8, 2026 07:122,59829,573,89221,310,000024,576stderr
6Sep 8, 2026 07:122,62430,055,20420,446,0001,071,00024,576stderr
7Sep 8, 2026 07:125,24351,272,61541,978,0001,021,00024,576stderr
8Sep 8, 2026 07:125,26152,293,27242,131,0001,011,00024,576stderr
9Sep 8, 2026 07:125,27252,325,09142,225,0001,012,00024,576stderr