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 27, 2026 16:09olliecrowolliecrowScore: 18,374Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2026 16:0918,368177,254,130146,631,0003,989,0002,449,408
2Mar 27, 2026 16:0918,374179,892,151146,674,0003,991,0002,461,696
3Mar 27, 2026 16:0918,384177,908,200147,756,0002,995,0002,424,832