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 17:23Karthik ReddyKarthik ReddyScore: 2,539Success
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 17:432,53329,786,40920,771,000020,480
2Oct 9, 2026 17:432,53429,771,42120,781,000020,480
3Oct 9, 2026 17:432,53629,647,28420,798,000020,480
4Oct 9, 2026 17:432,53829,689,31920,818,000020,480
5Oct 9, 2026 17:432,53929,718,18320,825,000020,480
6Oct 9, 2026 17:432,53929,821,39120,825,000020,480
7Oct 9, 2026 17:432,53929,767,02620,823,000020,480
8Oct 9, 2026 17:432,54129,830,35720,842,000020,480
9Oct 9, 2026 17:432,54129,914,64320,843,000020,480