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 23, 2026 05:53Charles CabergsCharles CabergsScore: 5,447Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2026 05:545,35162,505,37138,895,0004,986,0002,469,888
2Apr 23, 2026 05:545,39861,549,97941,253,0003,018,0002,392,064
3Apr 23, 2026 05:545,41958,922,24841,412,0003,030,0002,412,544
4Apr 23, 2026 05:545,43461,884,01541,528,0003,038,0002,367,488
5Apr 23, 2026 05:545,44760,680,13341,621,0003,045,0002,347,008
6Apr 23, 2026 05:545,47663,032,33742,911,0001,995,0002,318,336
7Apr 23, 2026 05:545,48764,346,12741,999,0002,999,0002,334,720
8Apr 23, 2026 05:545,50565,555,31343,141,0002,006,0002,363,392
9Apr 23, 2026 05:545,50961,255,67840,161,0005,020,0002,482,176