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 23, 2026 03:19olliecrowolliecrowScore: 23,776Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2026 03:203,29644,827,38124,025,0003,003,0002,498,560
2Apr 23, 2026 03:203,30348,145,99325,080,0002,006,0002,334,720
3Apr 23, 2026 03:203,35244,911,11326,471,0001,018,0002,371,584
4Apr 23, 2026 03:2023,767211,484,003191,899,0002,998,0002,514,944
5Apr 23, 2026 03:2023,776214,400,913190,969,0003,999,0002,490,368
6Apr 23, 2026 03:2023,781211,293,829192,009,0003,000,0002,498,560
7Apr 23, 2026 03:2023,798212,632,175193,148,0002,001,0002,314,240
8Apr 23, 2026 03:2023,805216,269,886192,200,0003,003,0002,555,904
9Apr 23, 2026 03:2023,813210,882,712194,268,0001,001,0002,301,952