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:43Karthik ReddyKarthik ReddyScore: 2,543Success
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:052,53429,656,12120,782,000020,480
2Oct 9, 2026 11:052,54129,794,47320,844,000020,480
3Oct 9, 2026 11:052,54229,678,65220,847,000020,480
4Oct 9, 2026 11:052,54329,777,36820,856,000020,480
5Oct 9, 2026 11:052,54329,768,28720,855,000020,480
6Oct 9, 2026 11:052,54529,759,42720,875,000020,480
7Oct 9, 2026 11:052,54529,766,25020,874,000020,480
8Oct 9, 2026 11:052,54729,802,80620,888,000020,480
9Oct 9, 2026 11:052,54829,657,33120,895,000020,480