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:39Andrew EpsteinAndrew EpsteinScore: 40,039Success
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:4039,272332,504,078321,008,0001,028,0002,117,632stderr
2Sep 19, 2026 19:4039,573334,930,859323,474,0001,027,0002,117,632stderr
3Sep 19, 2026 19:4039,823337,060,957325,536,0001,020,0002,117,632stderr
4Sep 19, 2026 19:4039,843337,122,967325,718,0001,002,0002,117,632stderr
5Sep 19, 2026 19:4040,039339,512,433327,313,0001,014,0002,117,632stderr
6Sep 19, 2026 19:4040,173340,632,392328,419,0001,002,0002,117,632stderr
7Sep 19, 2026 19:4040,470342,245,650330,856,0001,002,0002,117,632stderr
8Sep 19, 2026 19:4040,498342,602,611331,088,0001,002,0002,117,632stderr
9Sep 19, 2026 19:4040,701344,176,937332,752,0001,004,0002,117,632stderr