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 12:04Victor MerckléVictor MerckléScore: 4,129Success
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 12:083,79639,621,81821,445,0009,683,00024,576stderr
2Sep 8, 2026 12:083,83639,818,78320,922,00010,538,00024,576stderr
3Sep 8, 2026 12:083,84939,896,95121,440,00010,126,00024,576stderr
4Sep 8, 2026 12:083,88640,147,55621,283,00010,590,00024,576stderr
5Sep 8, 2026 12:084,12942,126,53121,642,00012,220,00024,576stderr
6Sep 8, 2026 12:086,425105,256,61722,477,00030,216,0006,316,032stderr
7Sep 8, 2026 12:086,752145,862,42222,798,00032,571,0008,413,184stderr
8Sep 8, 2026 12:087,01165,833,42344,319,00013,172,00024,576stderr
9Sep 8, 2026 12:0810,043177,342,15547,363,00034,992,00010,510,336stderr