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 11:24Victor MerckléVictor MerckléScore: 2,740Success
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 11:252,71130,622,50621,121,0001,115,0002,117,632stderr
2Sep 1, 2026 11:252,72530,856,59821,254,0001,094,0002,117,632stderr
3Sep 1, 2026 11:252,73431,483,25721,356,0001,065,0002,117,632stderr
4Sep 1, 2026 11:252,73531,475,38521,320,0001,109,0002,117,632stderr
5Sep 1, 2026 11:252,74030,994,67821,401,0001,068,0002,117,632stderr
6Sep 1, 2026 11:255,39652,773,45843,235,0001,015,0002,117,632stderr
7Sep 1, 2026 11:255,39652,391,96243,234,0001,014,0002,117,632stderr
8Sep 1, 2026 11:255,45752,970,15843,713,0001,036,0002,117,632stderr
9Sep 1, 2026 11:255,61763,134,89845,046,0001,017,0002,117,632stderr