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 20, 2026 14:18olliecrowolliecrowScore: 21,271Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 14:183,26950,386,21625,814,000992,0002,428,928
2Mar 20, 2026 14:1821,271205,159,834172,416,0002,004,0002,347,008
3Mar 20, 2026 14:1821,294199,235,829170,620,0003,991,0002,420,736