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 listJun 23, 2026 16:27Victor MerckléVictor MerckléScore: 3,276Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 16:273,18433,738,00525,053,0001,056,0002,117,632stderr
2Jun 23, 2026 16:273,19433,884,11823,989,0002,202,0002,117,632stderr
3Jun 23, 2026 16:273,19833,922,58925,164,0001,065,0002,117,632stderr
4Jun 23, 2026 16:273,25034,304,25624,582,0002,073,0002,117,632stderr
5Jun 23, 2026 16:273,27634,555,35724,752,0002,113,0002,117,632stderr
6Jun 23, 2026 16:273,47536,115,77526,320,0002,175,0002,117,632stderr
7Jun 23, 2026 16:2712,095106,832,78498,173,0001,014,0002,117,632stderr
8Jun 23, 2026 16:2712,616111,128,535102,445,0001,013,0002,117,632stderr
9Jun 23, 2026 16:2712,719111,916,880102,288,0002,013,0002,117,632stderr