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 10:14Victor MerckléVictor MerckléScore: 3,110Success
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 10:163,06533,414,97525,137,000024,576stderr
2Sep 8, 2026 10:163,06734,313,52125,156,000024,576stderr
3Sep 8, 2026 10:163,06733,465,14325,150,000024,576stderr
4Sep 8, 2026 10:163,07233,678,98024,164,0001,029,00024,576stderr
5Sep 8, 2026 10:163,11039,974,63725,502,000024,576stderr
6Sep 8, 2026 10:163,12842,861,07225,657,000024,576stderr
7Sep 8, 2026 10:165,81155,996,55846,643,0001,013,00024,576stderr
8Sep 8, 2026 10:1611,512102,627,01893,398,0001,005,00024,576stderr
9Sep 8, 2026 10:1612,019117,714,33797,554,0001,007,00024,576stderr