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 02:12Dominique GarmierDominique GarmierScore: 21,393Success
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 02:1221,308203,042,167172,726,0001,996,0002,347,008
2Mar 24, 2026 02:1221,393202,031,687173,432,0001,993,0002,367,488
3Mar 24, 2026 02:1221,443202,051,421173,831,0001,998,0002,506,752