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 listSep 4, 2026 10:04Victor MerckléVictor MerckléScore: 2,626Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 10:062,61429,557,34420,379,0001,057,0002,117,632stderr
2Sep 4, 2026 10:062,61629,648,66520,440,0001,015,0002,117,632stderr
3Sep 4, 2026 10:062,61929,657,73720,458,0001,025,0002,117,632stderr
4Sep 4, 2026 10:062,62129,777,46420,422,0001,073,0002,117,632stderr
5Sep 4, 2026 10:062,62629,808,95320,505,0001,031,0002,117,632stderr
6Sep 4, 2026 10:062,64531,398,12220,671,0001,025,0002,117,632stderr
7Sep 4, 2026 10:065,29451,758,37742,158,0001,253,0002,117,632stderr
8Sep 4, 2026 10:065,30551,669,34142,486,0001,015,0002,117,632stderr
9Sep 4, 2026 10:065,30551,625,83542,265,0001,244,0002,117,632stderr