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 08:23Victor MerckléVictor MerckléScore: 3,055Success
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 08:243,04533,136,41124,969,000024,576stderr
2Sep 8, 2026 08:243,04734,185,07124,992,000024,576stderr
3Sep 8, 2026 08:243,05133,230,34925,024,000024,576stderr
4Sep 8, 2026 08:243,05133,551,20325,025,000024,576stderr
5Sep 8, 2026 08:243,05533,313,70524,050,0001,008,00024,576stderr
6Sep 8, 2026 08:243,06233,613,13025,111,000024,576stderr
7Sep 8, 2026 08:243,06333,426,34325,123,000024,576stderr
8Sep 8, 2026 08:245,77955,919,21546,381,0001,014,00024,576stderr
9Sep 8, 2026 08:245,81256,725,44346,648,0001,014,00024,576stderr