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 28, 2026 13:29Shikhar SoniShikhar SoniScore: 42,070Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 13:304,58447,473,33736,555,0001,034,0002,113,536
2Jun 28, 2026 13:304,60847,205,50336,767,0001,019,0002,113,536
3Jun 28, 2026 13:304,60947,204,55636,755,0001,039,0002,113,536
4Jun 28, 2026 13:304,68347,931,58537,376,0001,027,0002,113,536
5Jun 28, 2026 13:3042,070354,561,497343,971,0001,003,0002,117,632
6Jun 28, 2026 13:3042,137355,349,404344,522,0001,004,0002,117,632
7Jun 28, 2026 13:3042,594358,719,352348,269,0001,005,0002,117,632
8Jun 28, 2026 13:3042,830360,680,217349,203,0002,006,0002,117,632
9Jun 28, 2026 13:3043,107362,891,806352,478,0001,005,0002,117,632