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 01:01olliecrowolliecrowScore: 3,537Success
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 01:013,43257,477,91725,126,0003,015,0002,379,776
2Mar 24, 2026 01:013,53756,174,28026,000,0003,000,0002,498,560
3Mar 24, 2026 01:0123,065213,316,696186,134,0003,002,0002,293,760