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 10, 2026 12:55olliecrowolliecrowScore: 12,000Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 12:5511,984127,333,15697,263,0001,002,0002,424,832
2Mar 10, 2026 12:5511,989120,119,92697,303,0001,003,0002,465,792
3Mar 10, 2026 12:5511,991121,940,29197,322,0001,003,0002,424,832
4Mar 10, 2026 12:5511,995123,738,76894,388,0003,974,0002,453,504
5Mar 10, 2026 12:5512,000115,934,74996,389,0002,008,0002,433,024
6Mar 10, 2026 12:5512,001124,758,16198,408,00002,424,832
7Mar 10, 2026 12:5512,012119,579,31997,491,0001,005,0002,506,752
8Mar 10, 2026 12:5512,015124,478,46297,522,0001,005,0002,412,544
9Mar 10, 2026 12:5512,034124,211,03898,682,00002,514,944