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 09:43Victor MerckléVictor MerckléScore: 4,815Success
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 09:494,33843,924,50021,782,00013,791,00024,576stderr
2Sep 8, 2026 09:494,78647,602,75322,262,00016,987,00024,576stderr
3Sep 8, 2026 09:494,79347,713,44721,941,00017,365,00024,576stderr
4Sep 8, 2026 09:494,80047,822,96322,425,00016,936,00024,576stderr
5Sep 8, 2026 09:494,81547,863,58222,529,00016,956,00024,576stderr
6Sep 8, 2026 09:494,93648,698,08922,216,00018,265,00024,576stderr
7Sep 8, 2026 09:495,65754,601,58022,248,00024,146,00024,576stderr
8Sep 8, 2026 09:496,29859,906,78122,755,00028,892,00016,801,792stderr
9Sep 8, 2026 09:496,35360,525,18222,575,00029,526,00024,576stderr