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 3, 2026 13:45TudyMTudyMScore: 17,039Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 13:4616,972152,935,141137,921,0001,255,0002,363,392
2May 3, 2026 13:4616,979155,536,162137,958,0001,271,0002,363,392
3May 3, 2026 13:4616,984153,614,939138,034,0001,241,0002,367,488
4May 3, 2026 13:4617,035155,981,936138,423,0001,271,0002,375,680
5May 3, 2026 13:4617,039154,886,705138,491,0001,230,0002,367,488
6May 3, 2026 13:4617,055156,181,190138,847,0001,008,0002,351,104
7May 3, 2026 13:4617,169158,056,154139,534,0001,255,0002,367,488
8May 3, 2026 13:4617,310156,263,271140,693,0001,252,0002,371,584
9May 3, 2026 13:4617,434158,654,716141,681,0001,280,0002,375,680