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 17, 2026 21:11Charles CabergsCharles CabergsScore: 33,203Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 17, 2026 21:1133,103304,534,02195,805,000175,642,0002,412,544
2Apr 17, 2026 21:1133,117304,597,87895,845,000175,717,0002,408,448
3Apr 17, 2026 21:1133,156299,137,75895,956,000175,920,0002,420,736
4Apr 17, 2026 21:1133,194293,678,32896,066,000176,121,0002,420,736
5Apr 17, 2026 21:1133,203297,285,79496,094,000176,173,0002,260,992
6Apr 17, 2026 21:1133,430305,158,58397,045,000177,083,0002,293,760
7Apr 17, 2026 21:1133,865303,756,85597,892,000179,801,0002,387,968
8Apr 17, 2026 21:1134,063304,181,44796,764,000182,555,0002,424,832
9Apr 17, 2026 21:1134,386311,508,09797,987,000183,977,0002,306,048