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 listJun 17, 2026 15:02Maya RebholzMaya RebholzScore: 12,283Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 15:0311,478103,876,53593,108,0001,012,0002,113,536
2Jun 17, 2026 15:0311,901106,690,62096,586,0001,007,0002,113,536
3Jun 17, 2026 15:0311,923106,972,05096,763,0001,008,0002,113,536
4Jun 17, 2026 15:0311,933107,049,25296,844,0001,007,0002,113,536
5Jun 17, 2026 15:0312,283109,951,23799,718,0001,009,0002,113,536
6Jun 17, 2026 15:0312,653113,025,411102,735,0001,023,0002,113,536
7Jun 17, 2026 15:0312,671113,186,337102,902,0001,007,0002,113,536
8Jun 17, 2026 15:0312,676113,186,498102,939,0001,008,0002,113,536
9Jun 17, 2026 15:0312,798114,210,117103,932,0001,013,0002,113,536