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 21, 2026 23:26M-RochatM-RochatScore: 8,326Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 23:277,73575,041,30759,409,0004,022,0002,113,536
2May 21, 2026 23:277,80173,399,44559,941,0004,033,0002,113,536
3May 21, 2026 23:277,80774,811,76559,948,0004,077,0002,113,536
4May 21, 2026 23:277,86173,880,36560,440,0004,028,0002,113,536
5May 21, 2026 23:278,32679,088,28864,233,0004,048,0002,113,536
6May 21, 2026 23:278,50779,822,34565,744,0004,017,0002,113,536
7May 21, 2026 23:2720,014176,665,577159,075,0005,046,0002,117,632
8May 21, 2026 23:2720,069174,174,834160,544,0004,024,0002,117,632
9May 21, 2026 23:2720,076173,951,551160,602,0004,022,0002,113,536