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 9, 2026 08:03Karthik ReddyKarthik ReddyScore: 2,535Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 08:052,53229,282,50320,764,000020,480
2Oct 9, 2026 08:052,53229,387,45620,764,000020,480
3Oct 9, 2026 08:052,53329,690,03120,778,000020,480
4Oct 9, 2026 08:052,53429,264,55220,782,000020,480
5Oct 9, 2026 08:052,53529,508,43020,792,000020,480
6Oct 9, 2026 08:052,53929,630,55120,820,000020,480
7Oct 9, 2026 08:052,54229,612,82720,846,000020,480
8Oct 9, 2026 08:052,54329,695,16320,859,000020,480
9Oct 9, 2026 08:052,54929,612,56520,906,000020,480