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 listOct 3, 2026 00:37Karthik ReddyKarthik ReddyScore: 2,830Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 3, 2026 00:382,5136,029,779,85620,607,000020,480
2Oct 3, 2026 00:382,7596,031,761,87920,648,0001,977,00020,480
3Oct 3, 2026 00:382,8036,032,265,97919,763,0003,229,00020,480
4Oct 3, 2026 00:382,8236,032,413,59219,746,0003,403,00020,480
5Oct 3, 2026 00:382,8306,032,505,61819,790,0003,417,00020,480
6Oct 3, 2026 00:382,9056,033,145,88819,766,0004,056,00020,480
7Oct 3, 2026 00:382,9436,033,361,92919,807,0004,331,00020,480
8Oct 3, 2026 00:383,5786,038,675,51519,932,0009,410,00020,480
9Oct 3, 2026 00:384,8296,048,773,01139,602,000020,480