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:11Victor MerckléVictor MerckléScore: 2,623Success
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 11:122,55929,301,98420,990,000024,576stderr
2Sep 8, 2026 11:122,59529,593,80921,283,000024,576stderr
3Sep 8, 2026 11:122,61329,688,53221,434,000024,576stderr
4Sep 8, 2026 11:122,61729,712,87821,464,000024,576stderr
5Sep 8, 2026 11:122,62330,000,49621,509,000024,576stderr
6Sep 8, 2026 11:122,62729,929,53121,546,000024,576stderr
7Sep 8, 2026 11:122,63937,929,85021,640,000024,576stderr
8Sep 8, 2026 11:125,38652,336,63443,154,0001,015,00024,576stderr
9Sep 8, 2026 11:1210,78596,801,21787,416,0001,022,00024,576stderr