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:12M-RochatM-RochatScore: 12,330Success
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:1212,072112,691,67095,632,0003,365,0002,113,536
2May 20, 2026 19:1212,160109,668,36696,364,0003,351,0002,113,536
3May 20, 2026 19:1212,232109,840,38996,858,0003,449,0002,113,536
4May 20, 2026 19:1212,250111,042,17597,122,0003,332,0002,113,536
5May 20, 2026 19:1212,330110,444,06597,715,0003,391,0002,113,536
6May 20, 2026 19:1212,415111,370,65798,360,0003,445,0002,113,536
7May 20, 2026 19:1216,958149,254,917135,783,0003,276,0002,117,632
8May 20, 2026 19:1217,082149,434,619136,671,0003,402,0002,117,632
9May 20, 2026 19:1217,089149,703,803136,866,0003,264,0002,117,632