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 23, 2026 07:10Dominique GarmierDominique GarmierScore: 10,429Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 07:1010,217116,317,82581,789,0001,994,0002,453,504
2Mar 23, 2026 07:1010,255106,577,96680,084,0004,004,0002,318,336
3Mar 23, 2026 07:1010,266107,945,43180,177,0004,008,0002,494,464
4Mar 23, 2026 07:1010,362110,971,98478,973,0005,998,0002,297,856
5Mar 23, 2026 07:1010,429111,238,41482,498,0003,018,0002,453,504
6Mar 23, 2026 07:1010,548106,706,19184,480,0002,011,0002,387,968
7Mar 23, 2026 07:1010,555113,032,86984,539,0002,012,0002,314,240
8Mar 23, 2026 07:1010,589113,051,94284,835,0001,996,0002,273,280
9Mar 23, 2026 07:1010,610111,623,88385,001,0002,000,0002,478,080