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 09:13Pavel SkripkinPavel SkripkinScore: 4,331Success
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 09:144,20048,457,74331,229,0003,219,0002,465,792
2May 10, 2026 09:144,27850,644,62431,948,0003,132,0002,498,560
3May 10, 2026 09:144,28648,235,29031,041,0004,107,0002,473,984
4May 10, 2026 09:144,32050,453,25231,207,0004,220,0002,519,040
5May 10, 2026 09:144,33150,046,85131,446,0004,073,0002,318,336
6May 10, 2026 09:1425,136221,062,527202,932,0003,189,0002,539,520
7May 10, 2026 09:1425,249221,674,812204,026,0003,022,0002,314,240
8May 10, 2026 09:1425,380223,120,475204,099,0004,022,0002,326,528
9May 10, 2026 09:1425,493224,299,397204,744,0004,301,0002,478,080