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 10, 2026 10:13Pavel SkripkinPavel SkripkinScore: 4,745Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 10:144,33649,056,34132,385,0003,178,0002,498,560
2May 10, 2026 10:144,41154,413,02832,905,0003,273,0002,400,256
3May 10, 2026 10:144,41352,500,12432,992,0003,200,0002,490,368
4May 10, 2026 10:144,48051,476,27932,512,0004,225,0002,404,352
5May 10, 2026 10:144,74554,108,27334,016,0004,894,0002,539,520
6May 10, 2026 10:1425,092220,195,499202,524,0003,233,0002,322,432
7May 10, 2026 10:1425,172219,486,874203,342,0003,069,0002,449,408
8May 10, 2026 10:1426,012232,433,177208,902,0004,398,0002,375,680
9May 10, 2026 10:1426,414231,361,195213,497,0003,103,0002,523,136