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 listJul 7, 2026 11:09Victor MerckléVictor MerckléScore: 2,907Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 11:102,86932,022,64322,512,0001,019,0002,117,632stderr
2Jul 7, 2026 11:102,87131,580,97722,514,0001,029,0002,117,632stderr
3Jul 7, 2026 11:102,88731,961,36322,665,0001,014,0002,117,632stderr
4Jul 7, 2026 11:102,89631,699,97922,627,0001,121,0002,117,632stderr
5Jul 7, 2026 11:102,90731,782,86522,726,0001,112,0002,117,632stderr
6Jul 7, 2026 11:102,91133,500,13722,832,0001,045,0002,117,632stderr
7Jul 7, 2026 11:1011,716104,121,76394,863,0001,216,0002,117,632stderr
8Jul 7, 2026 11:1011,751104,455,55295,243,0001,119,0002,117,632stderr
9Jul 7, 2026 11:1012,372109,415,984100,256,0001,197,0002,117,632stderr