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 25, 2026 14:45Elijah KinElijah KinScore: 78,928Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2026 14:4676,788642,299,735479,559,000150,108,0002,113,536
2May 25, 2026 14:4677,395644,250,807485,159,000149,483,0002,113,536
3May 25, 2026 14:4677,431644,907,155485,527,000149,411,0002,113,536
4May 25, 2026 14:4677,908649,823,862486,501,000152,350,0002,113,536
5May 25, 2026 14:4678,928658,856,200490,754,000156,458,0002,113,536
6May 25, 2026 14:4679,080658,398,297496,519,000151,945,0002,113,536
7May 25, 2026 14:4679,383661,610,963495,071,000155,876,0002,113,536
8May 25, 2026 14:4680,190669,260,269506,466,000151,092,0002,113,536
9May 25, 2026 14:4680,770673,471,589505,287,000157,033,0002,113,536