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 listMay 9, 2026 07:50Pavel SkripkinPavel SkripkinScore: 6,212Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 07:515,90561,528,01140,258,0008,165,0002,306,048
2May 9, 2026 07:516,07063,279,24341,524,0008,255,0002,514,944
3May 9, 2026 07:516,13665,533,53641,440,0008,877,0002,428,928
4May 9, 2026 07:516,19668,523,27741,616,0009,193,0002,478,080
5May 9, 2026 07:516,21263,686,55842,123,0008,822,0002,519,040
6May 9, 2026 07:516,26166,480,27742,211,0009,131,0002,457,600
7May 9, 2026 07:516,38568,506,27043,038,0009,321,0002,359,296
8May 9, 2026 07:516,39267,625,92643,319,0009,101,0002,449,408
9May 9, 2026 07:516,54368,878,24243,363,00010,293,0002,408,448