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 listApr 27, 2026 22:36TudyMTudyMScore: 24,707Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 22:4624,645223,404,809199,091,0003,001,0002,297,856
2Apr 27, 2026 22:4624,668219,049,952201,281,0001,001,0002,359,296
3Apr 27, 2026 22:4624,699222,747,234201,536,0001,002,0002,367,488
4Apr 27, 2026 22:4624,702220,683,373200,564,0001,995,0002,371,584
5Apr 27, 2026 22:4624,707224,287,543199,611,0002,994,0002,375,680
6Apr 27, 2026 22:4624,710220,339,407200,628,0001,996,0002,375,680
7Apr 27, 2026 22:4624,745227,389,127200,912,0001,999,0002,363,392
8Apr 27, 2026 22:4624,797222,012,746202,342,0001,001,0002,363,392
9Apr 27, 2026 22:4625,129223,413,815204,061,0002,000,0002,297,856