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 7, 2026 20:03Pavel SkripkinPavel SkripkinScore: 7,300Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 20:046,89269,080,08148,760,0007,761,0002,326,528
2May 7, 2026 20:047,01770,965,84849,785,0007,760,0002,445,312
3May 7, 2026 20:047,07375,904,62650,091,0007,913,0002,322,432
4May 7, 2026 20:047,15572,093,53150,469,0008,206,0002,555,904
5May 7, 2026 20:047,30072,837,62651,311,0008,557,0002,469,888
6May 7, 2026 20:047,30075,973,10051,506,0008,359,0002,306,048
7May 7, 2026 20:047,30671,930,71751,477,0008,435,0002,473,984
8May 7, 2026 20:047,43677,521,49552,089,0008,893,0002,543,616
9May 7, 2026 20:047,54777,291,82052,746,0009,147,0002,506,752