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 listJun 16, 2026 15:59Maya RebholzMaya RebholzScore: 31,485Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 16, 2026 16:0029,795253,909,788218,045,00026,274,0002,199,552
2Jun 16, 2026 16:0030,081256,282,429220,401,00026,268,0002,199,552
3Jun 16, 2026 16:0030,850262,183,871226,745,00026,232,0002,199,552
4Jun 16, 2026 16:0031,169264,878,482227,428,00028,161,0002,199,552
5Jun 16, 2026 16:0031,485267,286,301231,709,00026,472,0002,199,552
6Jun 16, 2026 16:0031,812270,438,026234,127,00026,737,0002,199,552
7Jun 16, 2026 16:0031,840270,680,261234,322,00026,773,0002,199,552
8Jun 16, 2026 16:0032,392278,118,934238,940,00026,677,0002,199,552
9Jun 16, 2026 16:0032,683277,318,809239,427,00028,578,0002,199,552