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 15, 2025 23:43Ian MckibbenIan MckibbenScore: 19,105Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 15, 2025 23:4212,959136,696,420105,264,0001,002,0002,408,448
2Jan 15, 2025 23:4212,988133,436,279105,495,0001,004,0002,408,448
3Jan 15, 2025 23:4212,991134,788,130105,519,0001,004,0002,420,736
4Jan 15, 2025 23:4319,105185,914,922155,667,000997,0002,277,376
5Jan 15, 2025 23:4319,110187,586,021154,708,0001,996,0002,412,544
6Jan 15, 2025 23:4319,305182,087,631157,303,0001,001,0002,461,696