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:56M-RochatM-RochatScore: 19,196Success
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:577,23869,339,70856,071,0003,288,0002,113,536
2May 21, 2026 23:577,25968,958,90156,226,0003,300,0002,113,536
3May 21, 2026 23:577,43173,904,04357,649,0003,288,0002,113,536
4May 21, 2026 23:577,45774,477,79157,800,0003,351,0002,113,536
5May 21, 2026 23:5719,196167,359,009152,986,0004,429,0002,117,632
6May 21, 2026 23:5719,400168,424,858154,586,0004,498,0002,113,536
7May 21, 2026 23:5719,435168,797,985154,954,0004,414,0002,117,632
8May 21, 2026 23:5719,515171,998,896155,698,0004,328,0002,117,632
9May 21, 2026 23:5719,565172,484,351156,035,0004,404,0002,117,632