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 listSep 7, 2026 16:18Victor MerckléVictor MerckléScore: 2,968Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 16:192,69830,510,87621,057,0001,067,00024,576stderr
2Sep 7, 2026 16:192,74631,647,49821,206,0001,313,00024,576stderr
3Sep 7, 2026 16:192,80031,114,42521,286,0001,676,00024,576stderr
4Sep 7, 2026 16:192,91032,070,21320,638,0003,228,00024,576stderr
5Sep 7, 2026 16:192,96833,386,33020,763,0003,576,00024,576stderr
6Sep 7, 2026 16:195,25151,457,44042,052,0001,009,00024,576stderr
7Sep 7, 2026 16:195,25951,581,63142,118,0001,013,00024,576stderr
8Sep 7, 2026 16:195,43853,051,46041,917,0002,681,00024,576stderr
9Sep 7, 2026 16:195,54453,872,35542,478,0002,990,00024,576stderr