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 1, 2026 18:12Pavel SkripkinPavel SkripkinScore: 12,728Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 18:1312,681120,581,841100,993,0002,999,0002,424,832
2May 1, 2026 18:1312,682119,805,851101,995,0001,999,0002,318,336
3May 1, 2026 18:1312,690121,060,462102,058,0002,001,0002,330,624
4May 1, 2026 18:1312,719120,905,230103,301,0001,002,0002,428,928
5May 1, 2026 18:1312,728121,259,005103,370,0001,003,0002,424,832
6May 1, 2026 18:1312,733119,961,935101,406,0003,012,0002,424,832
7May 1, 2026 18:1312,778130,538,720102,791,0001,995,0002,420,736
8May 1, 2026 18:1312,792124,727,312102,902,0001,998,0002,428,928
9May 1, 2026 18:1312,852123,793,560105,394,00002,416,640