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 listApr 25, 2026 08:15limanjun99limanjun99Score: 4,135Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2026 08:154,10651,190,03331,635,0002,041,0002,551,808
2Apr 25, 2026 08:154,13554,441,50430,918,0002,992,0002,555,904
3Apr 25, 2026 08:154,14653,815,08031,000,0003,000,0002,367,488