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 16, 2026 22:53M-RochatM-RochatScore: 17,615Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 22:5412,624112,421,74898,828,0004,690,0002,113,536
2May 16, 2026 22:5412,649112,558,74199,196,0004,530,0002,113,536
3May 16, 2026 22:5417,566152,856,325138,357,0005,687,0002,117,632
4May 16, 2026 22:5417,586152,989,559138,648,0005,564,0002,117,632
5May 16, 2026 22:5417,615168,670,910138,882,0005,564,0002,117,632
6May 16, 2026 22:5417,694153,875,892140,280,0004,811,0002,117,632
7May 16, 2026 22:5417,694153,866,385140,256,0004,835,0002,117,632
8May 16, 2026 22:5417,760154,452,649140,201,0005,438,0002,117,632
9May 16, 2026 22:5417,824165,858,385140,483,0005,675,0002,113,536