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 listSep 19, 2026 19:28Andrew EpsteinAndrew EpsteinScore: 24,844Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2026 19:302,65731,817,00921,791,000020,480
2Sep 19, 2026 19:3024,081206,187,886197,465,000020,480
3Sep 19, 2026 19:3024,105206,443,696197,663,000020,480
4Sep 19, 2026 19:3024,833212,425,593203,634,000020,480
5Sep 19, 2026 19:3024,844212,532,384203,725,000020,480
6Sep 19, 2026 19:3024,850212,550,537203,770,000020,480
7Sep 19, 2026 19:3024,950214,004,368204,591,000020,480
8Sep 19, 2026 19:3025,701219,501,432210,753,000020,480
9Sep 19, 2026 19:3026,019222,104,986213,356,000020,480