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 25, 2026 06:26olliecrowolliecrowScore: 3,627Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2026 06:303,57337,691,06527,279,0002,020,0002,400,256
2Apr 25, 2026 06:303,57637,611,27226,297,0003,034,0002,469,888
3Apr 25, 2026 06:303,59237,581,60928,441,0001,015,0002,404,352
4Apr 25, 2026 06:303,61137,844,07027,571,0002,042,0002,387,968
5Apr 25, 2026 06:303,62738,027,21226,768,0002,974,0002,387,968
6Apr 25, 2026 06:303,70137,557,15126,308,0004,047,0002,412,544
7Apr 25, 2026 06:3037,013311,016,191300,512,0002,995,0002,523,136
8Apr 25, 2026 06:3037,042311,339,773298,753,0004,995,0002,572,288
9Apr 25, 2026 06:3037,192313,610,192301,979,0002,999,0002,560,000