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 18:28Victor MerckléVictor MerckléScore: 11,784Success
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 18:292,88631,645,81922,645,0001,023,0002,117,632stderr
2Jul 9, 2026 18:292,93432,090,07623,047,0001,019,0002,117,632stderr
3Jul 9, 2026 18:2911,720104,079,75595,075,0001,034,0002,117,632stderr
4Jul 9, 2026 18:2911,780104,552,15995,563,0001,040,0002,117,632stderr
5Jul 9, 2026 18:2911,784104,670,93695,490,0001,146,0002,117,632stderr
6Jul 9, 2026 18:2911,795104,719,98595,667,0001,052,0002,117,632stderr
7Jul 9, 2026 18:2911,853105,169,29296,050,0001,148,0002,117,632stderr
8Jul 9, 2026 18:2911,894105,839,42496,337,0001,199,0002,117,632stderr
9Jul 9, 2026 18:2912,379109,496,837100,486,0001,024,0002,117,632stderr