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,113Success
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,196108,814,47495,988,0004,027,0002,113,536
2May 16, 2026 22:5412,207109,985,32596,540,0003,564,0002,113,536
3May 16, 2026 22:5412,232109,106,36896,783,0003,523,0002,113,536
4May 16, 2026 22:5417,006148,463,328134,834,0004,617,0002,117,632
5May 16, 2026 22:5417,113157,363,481135,733,0004,596,0002,117,632
6May 16, 2026 22:5417,141152,192,139135,941,0004,622,0002,117,632
7May 16, 2026 22:5417,142149,464,733135,981,0004,587,0002,117,632
8May 16, 2026 22:5417,174149,780,587136,313,0004,517,0002,117,632
9May 16, 2026 22:5417,265150,503,332137,970,0003,609,0002,117,632