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 20, 2026 19:23M-RochatM-RochatScore: 8,354Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 19:268,01677,061,27161,703,0004,033,0002,113,536
2May 20, 2026 19:268,10075,835,16562,258,0004,166,0002,113,536
3May 20, 2026 19:268,19977,226,56462,858,0004,375,0002,113,536
4May 20, 2026 19:268,22276,836,35963,360,0004,062,0002,113,536
5May 20, 2026 19:268,35479,102,19864,208,0004,298,0002,113,536
6May 20, 2026 19:2620,103174,641,055160,191,0004,659,0002,113,536
7May 20, 2026 19:2620,170174,862,654160,641,0004,761,0002,113,536
8May 20, 2026 19:2620,276175,672,353161,532,0004,733,0002,113,536
9May 20, 2026 19:2620,321178,886,809161,857,0004,781,0002,113,536