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 listMar 12, 2026 20:15Josu San MartinJosu San MartinScore: 12,403Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 12, 2026 20:1512,347126,888,512100,244,0001,002,0002,306,048
2Mar 12, 2026 20:1512,403127,956,027101,701,00002,301,952
3Mar 12, 2026 20:1512,564126,263,099101,023,0002,000,0002,363,392