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 17, 2026 04:27M-RochatM-RochatScore: 10,812Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 04:2910,66496,221,80080,207,0007,242,0002,113,536
2May 17, 2026 04:2910,670101,883,24680,034,0007,463,0002,113,536
3May 17, 2026 04:2910,67298,640,01980,191,0007,324,0002,113,536
4May 17, 2026 04:2910,80297,452,38181,229,0007,355,0002,113,536
5May 17, 2026 04:2910,81299,454,97981,061,0007,602,0002,113,536
6May 17, 2026 04:2910,86397,913,70081,524,0007,553,0002,113,536
7May 17, 2026 04:2922,823197,561,552178,863,0008,287,0002,117,632
8May 17, 2026 04:2922,835196,050,740178,914,0008,341,0002,117,632
9May 17, 2026 04:2922,860197,398,349179,085,0008,369,0002,117,632