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 07:53Zhou180Zhou180Score: 21,233Success
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 07:543,51438,017,41727,771,0001,045,0002,117,632
2Jun 26, 2026 07:543,51537,990,56327,767,0001,059,0002,117,632
3Jun 26, 2026 07:543,52038,132,26527,819,0001,045,0002,117,632
4Jun 26, 2026 07:5421,175182,803,124171,631,0002,011,0002,117,632
5Jun 26, 2026 07:5421,233183,316,591172,099,0002,012,0002,117,632
6Jun 26, 2026 07:5421,336184,080,092172,948,0002,013,0002,117,632
7Jun 26, 2026 07:5421,596186,216,599175,079,0002,009,0002,117,632
8Jun 26, 2026 07:5421,820188,090,584176,919,0002,011,0002,117,632
9Jun 26, 2026 07:5422,317194,355,232180,995,0002,011,0002,117,632