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 listOct 9, 2026 13:31Karthik ReddyKarthik ReddyScore: 2,542Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 13:572,53529,881,92920,789,000020,480
2Oct 9, 2026 13:572,53929,752,49220,827,000020,480
3Oct 9, 2026 13:572,54029,852,00020,828,000020,480
4Oct 9, 2026 13:572,54029,793,76420,834,000020,480
5Oct 9, 2026 13:572,54229,983,56120,852,000020,480
6Oct 9, 2026 13:572,54329,846,65720,854,000020,480
7Oct 9, 2026 13:572,54329,780,76320,856,000020,480
8Oct 9, 2026 13:572,54331,337,73320,859,000020,480
9Oct 9, 2026 13:572,54429,850,67920,867,000020,480