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 12: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 13:012,52729,684,18320,729,000020,480
2Oct 9, 2026 13:012,53029,668,98720,748,000020,480
3Oct 9, 2026 13:012,53429,604,07020,784,000020,480
4Oct 9, 2026 13:012,53629,877,70220,798,000020,480
5Oct 9, 2026 13:012,53729,712,19020,810,000020,480
6Oct 9, 2026 13:012,53929,702,71120,827,000020,480
7Oct 9, 2026 13:012,54229,718,87720,846,000020,480
8Oct 9, 2026 13:012,54529,939,24120,870,000020,480
9Oct 9, 2026 13:012,55129,697,61319,899,0001,020,00020,480