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 07:21M-RochatM-RochatScore: 31,960Success
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 07:2230,676262,395,247250,285,0001,261,0002,113,536
2May 16, 2026 07:2231,017265,860,078253,091,0001,255,0002,113,536
3May 16, 2026 07:2231,361268,386,439255,930,0001,235,0002,113,536
4May 16, 2026 07:2231,537270,288,468257,370,0001,239,0002,113,536
5May 16, 2026 07:2231,960271,038,827260,814,0001,266,0002,113,536
6May 16, 2026 07:2231,964270,831,197260,852,0001,259,0002,113,536
7May 16, 2026 07:2232,103272,752,157262,008,0001,243,0002,113,536
8May 16, 2026 07:2233,226281,475,824271,209,0001,250,0002,113,536
9May 16, 2026 07:2235,792303,816,617292,266,0001,229,0002,113,536