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 listOct 3, 2026 01:48Karthik ReddyKarthik ReddyScore: 2,492Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 3, 2026 01:492,48429,444,08220,374,000020,480
2Oct 3, 2026 01:492,48929,440,98320,413,000020,480
3Oct 3, 2026 01:492,48929,475,98920,414,000020,480
4Oct 3, 2026 01:492,49029,472,04420,426,000020,480
5Oct 3, 2026 01:492,49229,484,13620,435,000020,480
6Oct 3, 2026 01:492,49329,603,68120,448,000020,480
7Oct 3, 2026 01:492,49629,570,37420,474,000020,480
8Oct 3, 2026 01:492,49729,443,74220,477,000020,480
9Oct 3, 2026 01:492,49829,446,74320,486,000020,480