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 4, 2026 23:19olliecrowolliecrowScore: 21,404Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 23:203,29941,516,63126,009,0001,043,0002,306,048
2May 4, 2026 23:203,31845,739,68026,133,0001,080,0002,543,616
3May 4, 2026 23:203,31844,018,35326,166,0001,045,0002,297,856
4May 4, 2026 23:203,34143,339,82326,342,0001,057,0002,428,928
5May 4, 2026 23:2021,404194,593,317173,316,0002,198,0002,306,048
6May 4, 2026 23:2021,409192,856,936173,433,0002,123,0002,560,000
7May 4, 2026 23:2021,439193,913,549173,661,0002,139,0002,551,808
8May 4, 2026 23:2021,478194,222,220173,987,0002,136,0002,293,760
9May 4, 2026 23:2021,492194,965,213174,088,0002,154,0002,543,616