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 08:50Pavel SkripkinPavel SkripkinScore: 24,934Success
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 08:514,07449,452,67430,263,0003,148,0002,416,640
2May 10, 2026 08:514,14349,775,59130,646,0003,332,0002,564,096
3May 10, 2026 08:5123,857209,478,314192,594,0003,040,0002,314,240
4May 10, 2026 08:5124,479215,302,951197,511,0003,220,0002,498,560
5May 10, 2026 08:5124,934217,740,756201,062,0003,398,0002,334,720
6May 10, 2026 08:5125,002220,817,917201,730,0003,288,0002,445,312
7May 10, 2026 08:5125,037221,063,644201,898,0003,408,0002,473,984
8May 10, 2026 08:5125,323221,232,326204,192,0003,461,0002,371,584
9May 10, 2026 08:5125,505227,495,497205,861,0003,282,0002,334,720