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 21, 2026 18:18Charles CabergsCharles CabergsScore: 9,042Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 18:188,95487,929,76671,413,0002,011,0002,445,312
2Apr 21, 2026 18:188,98191,343,35871,635,0002,017,0002,355,200
3Apr 21, 2026 18:189,01486,854,77970,925,0002,996,0002,400,256
4Apr 21, 2026 18:189,03194,770,86470,059,0004,003,0002,404,352
5Apr 21, 2026 18:189,04293,353,76171,146,0003,006,0002,416,640
6Apr 21, 2026 18:189,04295,794,44070,142,0004,008,0002,424,832
7Apr 21, 2026 18:189,08692,004,92370,483,0004,027,0002,383,872
8Apr 21, 2026 18:189,08790,051,19871,496,0003,020,0002,531,328
9Apr 21, 2026 18:189,09895,623,08169,564,0005,040,0002,326,528