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 listSep 26, 2026 18:37Kevin HeaveyKevin HeaveyScore: 2,500Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2026 18:382,49129,122,29220,432,000020,480
2Sep 26, 2026 18:382,49728,998,06120,480,000020,480
3Sep 26, 2026 18:382,49929,109,00520,495,000020,480
4Sep 26, 2026 18:382,50029,044,18420,508,000020,480
5Sep 26, 2026 18:382,50029,178,27820,505,000020,480
6Sep 26, 2026 18:382,50929,274,48620,575,000020,480
7Sep 26, 2026 18:382,52729,401,38919,712,0001,015,00020,480
8Sep 26, 2026 18:385,63654,893,96644,190,0002,033,00020,480
9Sep 26, 2026 18:385,71555,297,07144,843,0002,024,00020,480