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 listMar 22, 2026 22:23izotoffizotoffScore: 24,726Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 22:2324,360227,445,716198,750,000998,0002,433,024
2Mar 22, 2026 22:2324,397224,864,758199,056,0001,000,0002,461,696
3Mar 22, 2026 22:2324,450234,786,666198,484,0002,004,0002,404,352
4Mar 22, 2026 22:2324,499232,823,423196,895,0003,997,0002,539,520
5Mar 22, 2026 22:2324,726227,511,310201,756,000998,0002,338,816
6Mar 22, 2026 22:2324,774229,506,029202,146,0001,000,0002,420,736
7Mar 22, 2026 22:2324,993232,277,217199,942,0004,998,0002,428,928
8Mar 22, 2026 22:2325,236235,123,925203,940,0002,999,0002,449,408
9Mar 22, 2026 22:2325,361238,284,139205,961,0001,999,0002,461,696