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 listAug 18, 2026 06:26Josu San MartinJosu San MartinScore: 3,686Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2026 06:263,66639,913,34427,841,0002,227,0002,121,728
2Aug 18, 2026 06:263,67439,967,72427,989,0002,143,0002,121,728
3Aug 18, 2026 06:263,67740,089,77628,000,0002,154,0002,121,728
4Aug 18, 2026 06:263,68540,004,36627,993,0002,229,0002,121,728
5Aug 18, 2026 06:263,68639,996,99628,002,0002,224,0002,121,728
6Aug 18, 2026 06:2611,677105,597,66793,550,0002,203,0002,121,728
7Aug 18, 2026 06:2611,698105,714,26793,773,0002,152,0002,121,728
8Aug 18, 2026 06:2611,849107,035,89795,012,0002,156,0002,121,728
9Aug 18, 2026 06:2611,858107,058,60795,027,0002,212,0002,121,728