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 25, 2026 15:32Zhou180Zhou180Score: 23,239Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 15:3322,751195,739,749184,553,0002,010,0002,117,632
2Jun 25, 2026 15:3322,958197,836,639186,247,0002,011,0002,117,632
3Jun 25, 2026 15:3323,153198,970,244187,848,0002,009,0002,117,632
4Jun 25, 2026 15:3323,188199,306,806188,133,0002,009,0002,117,632
5Jun 25, 2026 15:3323,239199,718,788188,550,0002,010,0002,117,632
6Jun 25, 2026 15:3323,256199,980,017187,468,0003,237,0002,117,632
7Jun 25, 2026 15:3323,494201,818,109190,641,0002,011,0002,117,632
8Jun 25, 2026 15:3323,860204,853,755193,373,0002,283,0002,117,632
9Jun 25, 2026 15:3324,028206,297,644193,961,0003,070,0002,117,632