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 24, 2026 00:16olliecrowolliecrowScore: 37,015Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 00:183,59037,672,69526,397,0003,045,0002,416,640
2Apr 24, 2026 00:183,77138,199,33626,939,0003,990,0002,539,520
3Apr 24, 2026 00:1836,897321,157,345296,565,0005,991,0002,371,584
4Apr 24, 2026 00:1836,909323,117,160299,664,0002,996,0002,383,872
5Apr 24, 2026 00:1837,015311,084,780297,539,0005,990,0002,367,488
6Apr 24, 2026 00:1837,085312,620,808299,101,0005,001,0002,580,480
7Apr 24, 2026 00:1837,150312,187,967300,641,0003,995,0002,334,720
8Apr 24, 2026 00:1837,171313,533,515298,807,0005,996,0002,433,024
9Apr 24, 2026 00:1837,173313,472,132301,815,0003,008,0002,580,480