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 26, 2026 06:34Zhou180Zhou180Score: 3,990Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 06:353,82040,453,19029,226,0002,103,0002,117,632
2Jun 26, 2026 06:353,82940,518,44329,213,0002,191,0002,117,632
3Jun 26, 2026 06:353,87840,889,56929,506,0002,301,0002,117,632
4Jun 26, 2026 06:353,88141,058,49229,639,0002,187,0002,117,632
5Jun 26, 2026 06:353,99041,896,81430,450,0002,269,0002,117,632
6Jun 26, 2026 06:3521,479185,254,043172,885,0003,247,0002,117,632
7Jun 26, 2026 06:3521,879188,602,517176,072,0003,343,0002,117,632
8Jun 26, 2026 06:3522,410192,914,510180,519,0003,246,0002,117,632
9Jun 26, 2026 06:3522,427193,051,034180,590,0003,312,0002,117,632