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 listMay 1, 2026 11:38Victor MerckléVictor MerckléScore: 14,946Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 11:393,78145,817,00428,010,0003,001,0002,306,048stderr
2May 1, 2026 11:3914,689140,923,244118,447,0002,007,0002,424,832stderr
3May 1, 2026 11:3914,870139,024,239117,939,0003,997,0002,347,008stderr
4May 1, 2026 11:3914,932138,443,904119,436,0003,010,0002,465,792stderr
5May 1, 2026 11:3914,946145,978,401121,558,0001,004,0002,408,448stderr
6May 1, 2026 11:3914,946138,364,329119,576,0002,989,0002,342,912stderr
7May 1, 2026 11:3914,947141,392,375119,583,0002,989,0002,498,560stderr
8May 1, 2026 11:3914,963140,105,122120,705,0001,995,0002,457,600stderr
9May 1, 2026 11:3915,051144,527,053122,420,0001,003,0002,379,776stderr