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 listApr 22, 2026 02:28olliecrowolliecrowScore: 3,467Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 02:303,38646,584,71926,742,0001,028,0002,433,024
2Apr 22, 2026 02:303,40150,206,98825,904,0001,992,0002,490,368
3Apr 22, 2026 02:303,40444,958,71525,920,0001,993,0002,486,272
4Apr 22, 2026 02:303,43845,264,68327,186,0001,006,0002,342,912
5Apr 22, 2026 02:303,46750,784,08528,436,00002,502,656
6Apr 22, 2026 02:3022,904205,911,455182,823,0004,995,0002,555,904
7Apr 22, 2026 02:3022,918209,744,174182,937,0004,998,0002,330,624
8Apr 22, 2026 02:3022,991205,653,294185,539,0002,992,0002,428,928
9Apr 22, 2026 02:3023,015206,335,355184,734,0003,994,0002,330,624