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 20:28olliecrowolliecrowScore: 17,557Success
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 20:2812,760130,062,895100,607,0004,024,0002,453,504
2Mar 10, 2026 20:2817,557171,561,458137,968,0005,998,0002,473,984
3Mar 10, 2026 20:2817,574172,948,124138,104,0006,004,0002,371,584