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 5, 2026 06:41olliecrowolliecrowScore: 22,840Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 06:473,26541,375,85125,545,0001,235,0002,543,616
2May 5, 2026 06:473,27343,994,64025,784,0001,058,0002,297,856
3May 5, 2026 06:473,30048,626,42326,017,0001,046,0002,367,488
4May 5, 2026 06:4722,837206,286,580185,104,0002,163,0002,342,912
5May 5, 2026 06:4722,840205,091,489184,923,0002,369,0002,555,904
6May 5, 2026 06:4722,934205,419,616185,918,0002,146,0002,469,888
7May 5, 2026 06:4722,936206,899,740185,879,0002,201,0002,486,272
8May 5, 2026 06:4722,983206,857,918186,271,0002,193,0002,453,504
9May 5, 2026 06:4722,995206,421,033186,363,0002,196,0002,342,912