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:37Victor MerckléVictor MerckléScore: 2,603Success
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:392,58129,551,50521,171,000024,576stderr
2Sep 8, 2026 10:392,58729,430,24921,214,000024,576stderr
3Sep 8, 2026 10:392,58929,572,21221,236,000024,576stderr
4Sep 8, 2026 10:392,59929,570,55621,319,000024,576stderr
5Sep 8, 2026 10:392,60330,545,03321,347,000024,576stderr
6Sep 8, 2026 10:395,30752,028,41742,503,0001,015,00024,576stderr
7Sep 8, 2026 10:395,31851,971,55242,599,0001,015,00024,576stderr
8Sep 8, 2026 10:395,32851,931,05142,683,0001,014,00024,576stderr
9Sep 8, 2026 10:395,33652,038,97142,747,0001,015,00024,576stderr