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 listFeb 7, 2026 03:17Josu San MartinJosu San MartinScore: 8,467Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2026 03:178,30096,131,00061,056,0007,006,0002,527,232
2Feb 7, 2026 03:178,467106,628,91665,402,0004,024,0002,400,256
3Feb 7, 2026 03:178,908104,239,87866,039,0007,004,0002,506,752