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: 11,506Success
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:0511,268102,150,85383,907,0008,496,0002,113,536
2May 17, 2026 04:0511,305101,583,25684,257,0008,451,0002,113,536
3May 17, 2026 04:0511,402102,369,35984,810,0008,691,0002,113,536
4May 17, 2026 04:0511,424102,706,62985,176,0008,502,0002,113,536
5May 17, 2026 04:0511,506103,093,96185,625,0008,730,0002,113,536
6May 17, 2026 04:0511,636104,427,59687,069,0008,352,0002,113,536
7May 17, 2026 04:0511,653104,384,70687,137,0008,424,0002,113,536
8May 17, 2026 04:0511,707106,770,57187,705,0008,297,0002,113,536
9May 17, 2026 04:0523,369200,403,176182,390,0009,236,0002,117,632