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 2, 2026 15:14Victor MerckléVictor MerckléScore: 11,939Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 15:152,99932,471,00723,482,0001,116,0002,117,632stderr
2Jul 2, 2026 15:153,00432,515,68023,486,0001,153,0002,117,632stderr
3Jul 2, 2026 15:153,00532,534,99523,606,0001,039,0002,117,632stderr
4Jul 2, 2026 15:1511,925105,412,22696,603,0001,190,0002,117,632stderr
5Jul 2, 2026 15:1511,939105,791,15496,870,0001,030,0002,117,632stderr
6Jul 2, 2026 15:1511,957105,973,59696,994,0001,058,0002,117,632stderr
7Jul 2, 2026 15:1511,974105,978,09997,056,0001,131,0002,117,632stderr
8Jul 2, 2026 15:1512,034106,528,43697,618,0001,066,0002,117,632stderr
9Jul 2, 2026 15:1512,061106,780,79097,766,0001,138,0002,117,632stderr