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 06:13Victor MerckléVictor MerckléScore: 2,595Success
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 06:142,59229,749,10821,258,000024,576stderr
2Sep 8, 2026 06:142,59329,471,36021,264,000024,576stderr
3Sep 8, 2026 06:142,59429,606,97921,272,000024,576stderr
4Sep 8, 2026 06:142,59531,066,81521,281,000024,576stderr
5Sep 8, 2026 06:142,59529,507,87921,281,000024,576stderr
6Sep 8, 2026 06:142,59829,539,79021,306,000024,576stderr
7Sep 8, 2026 06:142,60129,820,25721,332,000024,576stderr
8Sep 8, 2026 06:142,60629,923,49021,377,000024,576stderr
9Sep 8, 2026 06:145,26851,645,65642,186,0001,013,00024,576stderr