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 8, 2026 05:08Josu San MartinJosu San MartinScore: 11,387Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 8, 2026 05:0811,384114,630,47191,343,0002,007,0002,523,136
2Feb 8, 2026 05:0811,387116,752,28491,367,0002,008,0002,514,944
3Feb 8, 2026 05:0811,411127,225,43791,558,0002,012,0002,506,752