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 20:34olliecrowolliecrowScore: 35,264Success
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 20:373,59145,775,15028,439,0001,015,0002,355,200
2Apr 24, 2026 20:373,60938,011,17126,641,0002,960,0002,367,488
3Apr 24, 2026 20:373,62538,075,66527,749,0001,982,0002,330,624
4Apr 24, 2026 20:3735,250304,665,032284,051,0005,000,0002,383,872
5Apr 24, 2026 20:3735,264297,773,994286,171,0003,001,0002,412,544
6Apr 24, 2026 20:3735,338298,353,068284,783,0004,996,0002,473,984
7Apr 24, 2026 20:3735,347298,419,327284,849,0004,997,0002,433,024
8Apr 24, 2026 20:3735,430298,077,789285,539,0004,991,0002,584,576
9Apr 24, 2026 20:3735,760301,742,812290,223,0003,012,0002,510,848