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:14M-RochatM-RochatScore: 20,093Success
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:147,99478,130,28661,485,0004,070,0002,113,536
2May 20, 2026 19:148,20279,405,17463,180,0004,077,0002,113,536
3May 20, 2026 19:1420,020174,055,497160,143,0004,024,0002,117,632
4May 20, 2026 19:1420,060173,862,685160,477,0004,022,0002,117,632
5May 20, 2026 19:1420,093174,639,522160,745,0004,021,0002,117,632
6May 20, 2026 19:1420,121174,973,893160,978,0004,022,0002,117,632
7May 20, 2026 19:1420,208175,079,815161,692,0004,021,0002,117,632
8May 20, 2026 19:1420,210177,128,492161,700,0004,025,0002,117,632
9May 20, 2026 19:1420,505180,324,393164,121,0004,022,0002,117,632