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 listJun 11, 2026 05:40Victor MerckléVictor MerckléScore: 3,625Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2026 05:423,48038,554,34626,341,0002,197,0002,138,112
2Jun 11, 2026 05:423,52839,206,12926,657,0002,274,0002,138,112
3Jun 11, 2026 05:423,53738,787,10226,735,0002,274,0002,138,112
4Jun 11, 2026 05:423,55839,415,94926,871,0002,305,0002,138,112
5Jun 11, 2026 05:423,62539,791,98027,449,0002,284,0002,138,112
6Jun 11, 2026 05:423,64640,185,38527,662,0002,243,0002,138,112
7Jun 11, 2026 05:423,76341,577,93728,725,0002,135,0002,138,112
8Jun 11, 2026 05:4213,361119,733,528106,176,0003,390,0002,138,112
9Jun 11, 2026 05:4213,678122,064,034109,104,0003,059,0002,138,112