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:24Victor MerckléVictor MerckléScore: 2,940Success
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:252,86631,468,75022,455,0001,051,0002,117,632stderr
2Jul 7, 2026 11:252,89631,684,98022,697,0001,055,0002,117,632stderr
3Jul 7, 2026 11:252,90432,017,92322,766,0001,048,0002,117,632stderr
4Jul 7, 2026 11:252,91632,330,98922,852,0001,060,0002,117,632stderr
5Jul 7, 2026 11:252,94032,077,72923,014,0001,098,0002,117,632stderr
6Jul 7, 2026 11:2511,650103,492,08794,366,0001,168,0002,117,632stderr
7Jul 7, 2026 11:2511,691104,244,87494,703,0001,164,0002,117,632stderr
8Jul 7, 2026 11:2511,709103,977,14594,778,0001,242,0002,117,632stderr
9Jul 7, 2026 11:2511,798104,591,89895,551,0001,197,0002,117,632stderr