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 29, 2026 07:25olliecrowolliecrowScore: 23,775Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 07:263,29542,615,85725,018,0002,001,0002,560,000
2Apr 29, 2026 07:263,30251,413,45425,072,0002,005,0002,539,520
3Apr 29, 2026 07:263,31348,725,25025,160,0002,012,0002,383,872
4Apr 29, 2026 07:2623,763212,886,827192,865,0001,998,0002,531,328
5Apr 29, 2026 07:2623,775215,962,996192,959,0001,999,0002,392,064
6Apr 29, 2026 07:2623,789211,733,657193,073,0002,000,0002,527,232
7Apr 29, 2026 07:2623,806210,392,762193,213,0002,002,0002,473,984
8Apr 29, 2026 07:2623,835215,215,420193,451,0002,004,0002,510,848
9Apr 29, 2026 07:2623,836217,018,318194,458,0001,002,0002,547,712