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 listMar 24, 2026 02:26Dominique GarmierDominique GarmierScore: 17,083Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 02:5517,044173,555,956137,766,0001,996,0002,330,624
2Mar 24, 2026 02:2617,051174,545,672136,821,0002,996,0002,297,856
3Mar 24, 2026 02:5517,079165,361,676137,045,0003,000,0002,490,368
4Mar 24, 2026 02:5517,083167,997,589137,077,0003,001,0002,531,328
5Mar 24, 2026 02:2617,085160,479,640137,093,0003,002,0002,490,368
6Mar 24, 2026 02:2617,188164,464,839138,945,0001,999,0002,510,848