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 10:08Karthik 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 10:242,53129,605,81020,761,000020,480
2Oct 9, 2026 10:242,53229,586,44320,763,000020,480
3Oct 9, 2026 10:242,53429,631,12720,781,000020,480
4Oct 9, 2026 10:242,53529,615,12720,789,000020,480
5Oct 9, 2026 10:242,53529,702,90220,795,000020,480
6Oct 9, 2026 10:242,53629,629,40620,800,000020,480
7Oct 9, 2026 10:242,53929,687,06120,827,000020,480
8Oct 9, 2026 10:242,54429,751,76420,862,000020,480
9Oct 9, 2026 10:242,54529,791,20220,873,000020,480