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 16:06Victor MerckléVictor MerckléScore: 3,206Success
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 16:082,70830,704,24521,167,0001,042,00024,576stderr
2Sep 7, 2026 16:082,76031,782,29121,557,0001,076,00024,576stderr
3Sep 7, 2026 16:082,77130,945,17521,662,0001,067,00024,576stderr
4Sep 7, 2026 16:083,16634,282,44321,397,0004,572,00024,576stderr
5Sep 7, 2026 16:083,20635,430,78321,710,0004,583,00024,576stderr
6Sep 7, 2026 16:085,44852,962,00943,664,0001,015,00024,576stderr
7Sep 7, 2026 16:085,48353,452,29143,940,0001,024,00024,576stderr
8Sep 7, 2026 16:085,59954,294,22943,856,0002,059,00024,576stderr
9Sep 7, 2026 16:0815,320133,858,573121,719,0003,906,00024,576stderr