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 1, 2026 21:25Mehdi-Dehghan-FooladiMehdi-Dehghan-FooladiScore: 32,379Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 21:2531,791276,683,785257,695,0002,996,0002,502,656
2May 1, 2026 21:2531,961280,941,147259,085,0003,000,0002,342,912
3May 1, 2026 21:2532,158283,980,699260,700,0002,996,0002,498,560
4May 1, 2026 21:2532,170281,874,894261,798,0001,998,0002,498,560
5May 1, 2026 21:2532,379285,471,922262,515,0002,994,0002,498,560
6May 1, 2026 21:2532,476286,274,459264,306,0002,002,0002,342,912
7May 1, 2026 21:2532,582285,117,311265,177,0002,001,0002,338,816
8May 1, 2026 21:2533,031290,177,694267,864,0002,998,0002,297,856
9May 1, 2026 21:2534,088301,522,202277,526,0002,003,0002,502,656