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:18M-RochatM-RochatScore: 29,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 16, 2026 07:1927,605235,211,599225,139,0001,229,0002,113,536
2May 16, 2026 07:1929,001246,620,715236,584,0001,229,0002,113,536
3May 16, 2026 07:1929,109250,334,065237,433,0001,265,0002,113,536
4May 16, 2026 07:1929,137247,695,834237,682,0001,242,0002,113,536
5May 16, 2026 07:1929,330249,320,700239,252,0001,254,0002,113,536
6May 16, 2026 07:1929,776253,002,768243,162,0001,004,0002,113,536
7May 16, 2026 07:1929,788254,839,943243,022,0001,247,0002,113,536
8May 16, 2026 07:1930,116255,730,228245,708,0001,249,0002,113,536
9May 16, 2026 07:1930,971263,054,056252,730,0001,237,0002,113,536