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 13:07Victor MerckléVictor MerckléScore: 2,638Success
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 13:092,55529,190,25320,957,000024,576stderr
2Sep 8, 2026 13:092,59129,635,70721,250,000024,576stderr
3Sep 8, 2026 13:092,60629,720,37721,376,000024,576stderr
4Sep 8, 2026 13:092,62929,868,06921,561,000024,576stderr
5Sep 8, 2026 13:092,63830,788,42421,639,000024,576stderr
6Sep 8, 2026 13:092,64030,069,84721,651,000024,576stderr
7Sep 8, 2026 13:092,65430,059,47320,732,0001,032,00024,576stderr
8Sep 8, 2026 13:095,38152,341,60843,118,0001,014,00024,576stderr
9Sep 8, 2026 13:095,38752,403,72143,162,0001,015,00024,576stderr