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 listMay 9, 2026 07:53Pavel SkripkinPavel SkripkinScore: 6,495Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 07:536,18764,762,42742,289,0008,447,0002,363,392
2May 9, 2026 07:536,39268,911,79843,555,0008,862,0002,469,888
3May 9, 2026 07:536,43568,662,76444,239,0008,534,0002,351,104
4May 9, 2026 07:536,48069,595,35544,093,0009,051,0002,351,104
5May 9, 2026 07:536,49568,895,00244,289,0008,978,0002,355,200
6May 9, 2026 07:536,66568,067,24045,262,0009,392,0002,498,560
7May 9, 2026 07:536,85172,778,86046,344,0009,841,0002,355,200
8May 9, 2026 07:536,91569,600,56846,394,00010,314,0002,379,776
9May 9, 2026 07:536,93174,196,95646,937,0009,904,0002,367,488