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 listMar 22, 2026 21:44izotoffizotoffScore: 40,777Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 21:4440,238352,610,445327,951,0001,999,0002,412,544
2Mar 22, 2026 21:4440,303361,034,817328,478,0002,009,0002,408,448
3Mar 22, 2026 21:4440,373356,276,558325,057,0006,001,0002,404,352
4Mar 22, 2026 21:4440,471360,327,358329,863,0001,999,0002,322,432
5Mar 22, 2026 21:4440,777356,710,239332,369,0002,002,0002,404,352
6Mar 22, 2026 21:4440,850361,219,929332,970,0001,999,0002,334,720
7Mar 22, 2026 21:4441,060359,452,260332,695,0003,996,0002,412,544
8Mar 22, 2026 21:4441,233363,351,834335,107,0003,000,0002,322,432
9Mar 22, 2026 21:4441,402369,546,658338,496,0001,001,0002,404,352