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 9, 2026 06:41Victor MerckléVictor MerckléScore: 3,037Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 06:422,85831,895,43322,422,0001,017,0002,117,632stderr
2Jul 9, 2026 06:422,87631,669,90322,549,0001,035,0002,117,632stderr
3Jul 9, 2026 06:422,88831,718,94022,674,0001,014,0002,117,632stderr
4Jul 9, 2026 06:422,89831,824,55222,735,0001,033,0002,117,632stderr
5Jul 9, 2026 06:423,03732,919,28523,751,0001,160,0002,117,632stderr
6Jul 9, 2026 06:4211,639103,462,42094,407,0001,035,0002,117,632stderr
7Jul 9, 2026 06:4211,673103,674,31394,696,0001,024,0002,117,632stderr
8Jul 9, 2026 06:4211,727104,194,69595,136,0001,028,0002,117,632stderr
9Jul 9, 2026 06:4211,782104,625,90395,496,0001,117,0002,117,632stderr