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 19:29Charles CabergsCharles CabergsScore: 5,285Success
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 19:305,18263,010,07840,473,0002,023,0002,375,680
2Apr 23, 2026 19:305,19460,663,71541,578,0001,014,0002,371,584
3Apr 23, 2026 19:305,20764,264,70540,670,0002,033,0002,359,296
4Apr 23, 2026 19:305,25260,840,18242,067,0001,001,0002,347,008
5Apr 23, 2026 19:305,28560,096,69241,327,0002,015,0002,359,296
6Apr 23, 2026 19:305,29563,414,50539,384,0004,039,0002,359,296
7Apr 23, 2026 19:305,30657,580,49941,491,0002,023,0002,449,408
8Apr 23, 2026 19:305,32861,297,14736,743,0006,951,0002,363,392
9Apr 23, 2026 19:305,33861,057,42841,784,0001,989,0002,351,104