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:05M-RochatM-RochatScore: 10,351Success
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:0710,18992,335,29177,151,0006,400,0002,113,536
2May 17, 2026 04:0710,21492,528,29477,298,0006,463,0002,113,536
3May 17, 2026 04:0710,32093,418,02278,357,0006,273,0002,113,536
4May 17, 2026 04:0710,33895,364,10678,245,0006,530,0002,113,536
5May 17, 2026 04:0710,35193,652,86278,282,0006,602,0002,113,536
6May 17, 2026 04:0710,39494,882,05878,651,0006,581,0002,113,536
7May 17, 2026 04:0710,55598,170,25180,172,0006,382,0002,113,536
8May 17, 2026 04:0722,273191,451,678174,809,0007,832,0002,113,536
9May 17, 2026 04:0722,345192,018,665175,660,0007,576,0002,117,632