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 24, 2026 05:48Charles CabergsCharles CabergsScore: 9,739Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 05:494,71059,687,94537,610,0001,016,0002,355,200
2Apr 24, 2026 05:494,73557,117,85536,839,0001,991,0002,334,720
3Apr 24, 2026 05:494,90456,958,42136,194,0004,021,0002,355,200
4Apr 24, 2026 05:495,12659,096,59239,035,0003,002,0002,318,336
5Apr 24, 2026 05:499,739104,092,14774,869,0004,991,0002,379,776
6Apr 24, 2026 05:499,79899,387,69777,332,0003,012,0002,383,872
7Apr 24, 2026 05:499,799101,177,95775,336,0005,022,0002,347,008
8Apr 24, 2026 05:499,83394,250,29677,615,0003,023,0002,363,392
9Apr 24, 2026 05:499,848101,359,91577,765,0002,990,0002,330,624