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 listApr 28, 2026 23:35olliecrowolliecrowScore: 23,769Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 23:363,31046,317,34025,135,0002,010,0002,473,984stderr
2Apr 28, 2026 23:363,33445,110,30624,308,0003,038,0002,523,136stderr
3Apr 28, 2026 23:3623,736210,537,228190,650,0003,992,0002,564,096stderr
4Apr 28, 2026 23:3623,742212,471,763191,692,0002,995,0002,547,712stderr
5Apr 28, 2026 23:3623,769213,824,553191,909,0002,998,0002,551,808stderr
6Apr 28, 2026 23:3623,805217,229,722193,201,0002,002,0002,478,080stderr
7Apr 28, 2026 23:3623,810217,253,720190,236,0005,006,0002,510,848stderr
8Apr 28, 2026 23:3623,831215,929,706193,414,0002,004,0002,486,272stderr
9Apr 28, 2026 23:3623,831212,913,365193,412,0002,004,0002,539,520stderr