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 7, 2026 19:53Pavel SkripkinPavel SkripkinScore: 7,382Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 19:547,17271,782,38051,355,0007,462,0002,473,984
2May 7, 2026 19:547,26076,654,27851,578,0007,960,0002,433,024
3May 7, 2026 19:547,33873,703,67851,932,0008,240,0002,519,040
4May 7, 2026 19:547,35475,914,98652,212,0008,098,0002,387,968
5May 7, 2026 19:547,38275,946,59152,215,0008,325,0002,363,392
6May 7, 2026 19:547,39974,824,53152,679,0008,000,0002,392,064
7May 7, 2026 19:547,46475,153,89652,822,0008,385,0002,306,048
8May 7, 2026 19:547,57778,858,60053,251,0008,888,0002,367,488
9May 7, 2026 19:547,64075,679,31254,159,0008,492,0002,359,296