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 1, 2026 06:07Victor MerckléVictor MerckléScore: 5,384Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 06:082,72030,700,12921,207,0001,104,0002,117,632stderr
2Sep 1, 2026 06:082,79631,292,49621,713,0001,218,0002,117,632stderr
3Sep 1, 2026 06:085,32152,030,41942,594,0001,046,0002,117,632stderr
4Sep 1, 2026 06:085,34352,262,47542,726,0001,089,0002,117,632stderr
5Sep 1, 2026 06:085,38453,202,67843,021,0001,131,0002,117,632stderr
6Sep 1, 2026 06:085,46553,395,83343,784,0001,034,0002,117,632stderr
7Sep 1, 2026 06:085,47553,310,76843,863,0001,035,0002,117,632stderr
8Sep 1, 2026 06:085,48854,049,08943,985,0001,022,0002,117,632stderr
9Sep 1, 2026 06:085,52853,755,24844,313,0001,022,0002,117,632stderr