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 15, 2026 19:36M-RochatM-RochatScore: 109,276Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 19:3676,484636,676,417443,505,000183,670,0002,113,536
2May 15, 2026 19:36109,276906,878,445712,659,000183,406,0002,113,536
3May 15, 2026 19:36109,992911,412,226717,803,000184,136,0002,113,536