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:04Victor MerckléVictor MerckléScore: 2,994Success
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:052,85331,319,28822,302,0001,100,0002,117,632stderr
2Jul 7, 2026 11:052,87031,492,33522,412,0001,130,0002,117,632stderr
3Jul 7, 2026 11:052,89131,653,36322,668,0001,040,0002,117,632stderr
4Jul 7, 2026 11:052,92231,891,87522,945,0001,023,0002,117,632stderr
5Jul 7, 2026 11:052,99432,499,45023,455,0001,097,0002,117,632stderr
6Jul 7, 2026 11:0511,646103,454,96294,483,0001,018,0002,117,632stderr
7Jul 7, 2026 11:0511,682103,884,01994,664,0001,136,0002,117,632stderr
8Jul 7, 2026 11:0511,705103,926,88494,969,0001,018,0002,117,632stderr
9Jul 7, 2026 11:0511,746104,250,49295,195,0001,127,0002,117,632stderr