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 7, 2026 17:28Victor MerckléVictor MerckléScore: 2,691Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 17:292,67730,122,83121,955,000024,576stderr
2Sep 7, 2026 17:292,67930,304,65121,969,000024,576stderr
3Sep 7, 2026 17:292,68530,338,51920,981,0001,037,00024,576stderr
4Sep 7, 2026 17:292,68830,463,58622,044,000024,576stderr
5Sep 7, 2026 17:292,69130,386,38522,074,000024,576stderr
6Sep 7, 2026 17:292,69430,394,63121,069,0001,025,00024,576stderr
7Sep 7, 2026 17:292,69430,361,44522,097,000024,576stderr
8Sep 7, 2026 17:292,69531,187,35022,105,000024,576stderr
9Sep 7, 2026 17:292,70431,304,74321,155,0001,024,00024,576stderr