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 listJul 7, 2026 13:09Victor MerckléVictor MerckléScore: 16,709Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 13:117,91472,725,78063,757,0001,143,0002,117,632stderr
2Jul 7, 2026 13:117,92272,865,16863,810,0001,157,0002,117,632stderr
3Jul 7, 2026 13:117,92472,933,75263,972,0001,007,0002,117,632stderr
4Jul 7, 2026 13:117,95673,156,54764,228,0001,017,0002,117,632stderr
5Jul 7, 2026 13:1116,709144,963,953135,974,0001,046,0002,117,632stderr
6Jul 7, 2026 13:1116,730145,047,483136,074,0001,119,0002,117,632stderr
7Jul 7, 2026 13:1116,737145,234,672136,101,0001,149,0002,117,632stderr
8Jul 7, 2026 13:1116,760145,626,751136,225,0001,207,0002,117,632stderr
9Jul 7, 2026 13:1117,030147,885,381138,485,0001,161,0002,117,632stderr