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 11:58Victor MerckléVictor MerckléScore: 2,645Success
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:022,55629,167,84220,963,000024,576stderr
2Sep 8, 2026 12:022,60329,646,09821,350,000024,576stderr
3Sep 8, 2026 12:022,63829,863,43421,636,000024,576stderr
4Sep 8, 2026 12:022,64030,900,55321,649,000024,576stderr
5Sep 8, 2026 12:022,64529,972,31321,697,000024,576stderr
6Sep 8, 2026 12:025,37552,399,11443,069,0001,014,00024,576stderr
7Sep 8, 2026 12:025,43452,858,08343,546,0001,013,00024,576stderr
8Sep 8, 2026 12:025,45452,974,72143,715,0001,015,00024,576stderr
9Sep 8, 2026 12:025,47053,139,11643,842,0001,014,00024,576stderr