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 listSep 24, 2026 06:58Kevin HeaveyKevin HeaveyScore: 31,249Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 06:5929,463251,988,422241,604,000020,480
2Sep 24, 2026 06:5930,188256,920,560247,548,000020,480
3Sep 24, 2026 06:5931,050263,985,188254,613,000020,480
4Sep 24, 2026 06:5931,204264,664,050255,877,000020,480
5Sep 24, 2026 06:5931,249265,621,333256,244,000020,480
6Sep 24, 2026 06:5931,274265,274,115255,434,0001,014,00020,480
7Sep 24, 2026 06:5931,414266,939,570257,598,000020,480
8Sep 24, 2026 06:5931,470267,416,011258,062,000020,480
9Sep 24, 2026 06:5932,376274,912,507265,487,000020,480