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:42Karthik ReddyKarthik ReddyScore: 2,537Success
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 11:022,52929,608,14420,739,000020,480
2Oct 9, 2026 11:022,53529,602,15320,793,000020,480
3Oct 9, 2026 11:022,53629,723,94920,798,000020,480
4Oct 9, 2026 11:022,53629,704,78720,803,000020,480
5Oct 9, 2026 11:022,53729,727,33420,809,000020,480
6Oct 9, 2026 11:022,54229,781,11920,846,000020,480
7Oct 9, 2026 11:022,54329,845,47320,856,000020,480
8Oct 9, 2026 11:022,54529,839,28020,870,000020,480
9Oct 9, 2026 11:022,54729,809,45320,891,000020,480