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 08:41Zhou180Zhou180Score: 21,797Success
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 08:423,51238,019,33827,749,0001,055,0002,117,632
2Jun 26, 2026 08:423,52138,036,14727,835,0001,044,0002,117,632
3Jun 26, 2026 08:423,52438,025,57527,854,0001,045,0002,117,632
4Jun 26, 2026 08:423,54838,263,18427,001,0002,099,0002,117,632
5Jun 26, 2026 08:4221,797187,889,270175,702,0003,038,0002,117,632
6Jun 26, 2026 08:4221,868188,553,324176,287,0003,035,0002,117,632
7Jun 26, 2026 08:4222,008189,701,640178,457,0002,011,0002,117,632
8Jun 26, 2026 08:4222,080190,205,448178,006,0003,051,0002,117,632
9Jun 26, 2026 08:4222,289191,950,505180,764,0002,013,0002,117,632