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 18, 2026 03:55M-RochatM-RochatScore: 22,396Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 03:5610,36397,817,43680,906,0004,074,0002,113,536
2May 18, 2026 03:5610,37394,836,76880,899,0004,167,0002,113,536
3May 18, 2026 03:5622,332195,325,833178,110,0005,016,0002,117,632
4May 18, 2026 03:5622,344192,566,349178,093,0005,130,0002,117,632
5May 18, 2026 03:5622,396193,079,844178,636,0005,015,0002,117,632
6May 18, 2026 03:5622,398193,872,101179,643,0004,023,0002,117,632
7May 18, 2026 03:5622,443195,807,866179,016,0005,017,0002,117,632
8May 18, 2026 03:5622,476193,740,764179,209,0005,096,0002,117,632
9May 18, 2026 03:5622,560194,435,955179,995,0005,005,0002,117,632