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 listFeb 19, 2026 10:24Aleksei ShahoikaAleksei ShahoikaScore: 11,553Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 10:2411,473118,565,68292,079,0002,001,0002,371,584
2Feb 19, 2026 10:2411,496119,122,43893,269,0001,002,0002,367,488
3Feb 19, 2026 10:2411,497116,538,88093,274,0001,002,0002,301,952
4Feb 19, 2026 10:2411,500119,523,36592,293,0002,006,0002,355,200
5Feb 19, 2026 10:2411,553120,762,29592,743,0001,994,0002,359,296
6Feb 19, 2026 10:2411,554117,528,83792,747,0001,994,0002,318,336
7Feb 19, 2026 10:2411,568122,514,02892,860,0001,997,0002,318,336
8Feb 19, 2026 10:2411,575118,128,77593,919,000999,0002,297,856
9Feb 19, 2026 10:2411,673122,279,31692,724,0002,991,0002,523,136