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 listSep 3, 2026 04:18Josu San MartinJosu San MartinScore: 3,964Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 04:193,89542,267,03329,638,0002,309,0002,113,536
2Sep 3, 2026 04:193,92042,216,15229,823,0002,327,0002,113,536
3Sep 3, 2026 04:193,95543,300,49730,211,0002,225,0002,113,536
4Sep 3, 2026 04:193,96342,541,98029,433,0003,064,0002,113,536
5Sep 3, 2026 04:193,96442,584,75130,196,0002,314,0002,113,536
6Sep 3, 2026 04:193,98142,699,92230,277,0002,374,0002,113,536
7Sep 3, 2026 04:193,98843,426,45630,639,0002,065,0002,113,536
8Sep 3, 2026 04:194,00743,538,33430,800,0002,062,0002,113,536
9Sep 3, 2026 04:1911,982109,041,64791,580,0006,675,0002,113,536