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 21:10Victor MerckléVictor MerckléScore: 31,640Success
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 21:1131,438273,606,554255,801,0001,998,0002,322,432
2Apr 27, 2026 21:1131,627282,525,048256,342,0003,004,0002,531,328
3Apr 27, 2026 21:1131,636277,532,963258,419,0001,001,0002,334,720
4Apr 27, 2026 21:1131,638278,401,816257,429,0002,003,0002,510,848
5Apr 27, 2026 21:1131,640284,472,321256,459,0002,993,0002,531,328
6Apr 27, 2026 21:1131,999281,969,316260,395,0002,003,0002,330,624
7Apr 27, 2026 21:1132,070277,609,961260,983,0001,999,0002,527,232
8Apr 27, 2026 21:1132,339282,816,412263,184,0002,001,0002,523,136
9Apr 27, 2026 21:1132,761285,421,597266,649,0001,997,0002,531,328