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:16Victor MerckléVictor MerckléScore: 3,136Success
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:172,89633,220,53822,734,0001,018,0002,117,632stderr
2Jul 9, 2026 18:172,90631,864,42222,723,0001,113,0002,117,632stderr
3Jul 9, 2026 18:172,92531,810,15422,878,0001,112,0002,117,632stderr
4Jul 9, 2026 18:172,97532,956,58823,369,0001,030,0002,117,632stderr
5Jul 9, 2026 18:173,13633,753,49024,690,0001,029,0002,117,632stderr
6Jul 9, 2026 18:1711,739104,325,25495,234,0001,033,0002,117,632stderr
7Jul 9, 2026 18:1712,043106,663,63997,612,0001,145,0002,117,632stderr
8Jul 9, 2026 18:1712,401109,636,982100,510,0001,180,0002,117,632stderr
9Jul 9, 2026 18:1712,423110,371,087100,840,0001,034,0002,117,632stderr