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 4, 2026 06:24Victor MerckléVictor MerckléScore: 2,949Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 06:252,89731,596,38622,652,0001,110,0002,117,632stderr
2Jul 4, 2026 06:252,91632,025,78722,893,0001,023,0002,117,632stderr
3Jul 4, 2026 06:252,93931,856,76723,072,0001,034,0002,117,632stderr
4Jul 4, 2026 06:252,94031,999,47923,090,0001,026,0002,117,632stderr
5Jul 4, 2026 06:252,94932,001,80723,155,0001,033,0002,117,632stderr
6Jul 4, 2026 06:2511,705103,852,31694,935,0001,046,0002,117,632stderr
7Jul 4, 2026 06:2511,714103,871,32694,911,0001,145,0002,117,632stderr
8Jul 4, 2026 06:2511,831104,866,96595,961,0001,054,0002,117,632stderr
9Jul 4, 2026 06:2511,885105,467,01496,308,0001,150,0002,117,632stderr