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 22:22olliecrowolliecrowScore: 3,437Success
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 22:223,40455,351,71824,923,0002,990,0002,441,216
2Mar 10, 2026 22:223,41355,753,67624,991,0002,998,0002,367,488
3Mar 10, 2026 22:223,42056,862,43626,040,0002,003,0002,383,872
4Mar 10, 2026 22:223,42254,517,74526,056,0002,004,0002,371,584
5Mar 10, 2026 22:223,43759,269,81225,162,0003,019,0002,367,488
6Mar 10, 2026 22:223,43850,549,66526,178,0002,013,0002,293,760
7Mar 10, 2026 22:2218,664180,256,803150,045,0003,000,0002,428,928
8Mar 10, 2026 22:2218,679183,965,610150,165,0003,003,0002,318,336
9Mar 10, 2026 22:2218,860183,453,226150,660,0003,991,0002,281,472