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 listJan 9, 2025 08:10Ian MckibbenIan MckibbenScore: 106,952Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 9, 2025 08:1090,199767,577,887547,727,000191,904,0002,486,272
2Jan 9, 2025 08:1092,136783,869,882558,643,000196,874,0002,408,448
3Jan 9, 2025 08:1097,047826,253,815610,837,000184,950,0002,293,760
4Jan 9, 2025 08:1099,643845,066,749617,299,000199,773,0002,306,048
5Jan 9, 2025 08:10106,952908,616,676691,217,000185,789,0002,301,952
6Jan 9, 2025 08:10107,569910,235,933687,269,000194,793,0002,281,472
7Jan 9, 2025 08:10117,140982,921,794762,643,000197,907,0002,486,272
8Jan 9, 2025 08:10117,215992,052,358766,336,000194,831,0002,449,408
9Jan 9, 2025 08:10120,4951,015,778,822787,247,000200,808,0002,297,856