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 listAug 19, 2026 14:59Victor MerckléVictor MerckléScore: 5,433Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2026 15:002,73230,681,29621,355,0001,048,0002,117,632stderr
2Aug 19, 2026 15:002,76430,759,48221,609,0001,062,0002,117,632stderr
3Aug 19, 2026 15:005,42853,473,11643,391,0001,126,0002,117,632stderr
4Aug 19, 2026 15:005,43353,570,65943,367,0001,187,0002,117,632stderr
5Aug 19, 2026 15:005,43353,579,77743,489,0001,067,0002,117,632stderr
6Aug 19, 2026 15:005,43752,877,97743,453,0001,133,0002,117,632stderr
7Aug 19, 2026 15:005,43952,731,91243,457,0001,144,0002,117,632stderr
8Aug 19, 2026 15:005,44053,641,96643,475,0001,139,0002,117,632stderr
9Aug 19, 2026 15:005,46353,755,29543,658,0001,142,0002,117,632stderr