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 19:59M-RochatM-RochatScore: 13,644Success
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 20:1113,631122,383,277110,766,0001,009,0002,113,536
2May 16, 2026 20:1113,632120,503,249110,781,0001,009,0002,113,536
3May 16, 2026 20:1113,639120,636,931110,835,0001,009,0002,113,536
4May 16, 2026 20:1113,639121,030,625110,834,0001,009,0002,113,536
5May 16, 2026 20:1113,644122,577,346109,857,0002,024,0002,113,536
6May 16, 2026 20:1113,645121,614,314110,882,0001,008,0002,113,536
7May 16, 2026 20:1113,652123,593,832110,942,0001,009,0002,113,536
8May 16, 2026 20:1113,680121,175,511110,150,0002,026,0002,113,536
9May 16, 2026 20:1113,682121,022,782111,189,0001,008,0002,113,536