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 listMar 24, 2026 13:59Arseniy KorobenkoArseniy KorobenkoScore: 99,345Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 13:5993,003789,107,837634,687,000127,937,0002,281,472
2Mar 24, 2026 13:5993,861791,212,969646,718,000122,946,0002,383,872
3Mar 24, 2026 13:5997,045818,641,998685,800,000109,968,0002,289,664
4Mar 24, 2026 13:5998,177829,492,579690,188,000114,865,0002,494,464
5Mar 24, 2026 13:5999,345842,709,023701,683,000112,949,0002,293,760
6Mar 24, 2026 13:5999,843841,968,485697,758,000120,958,0002,297,856
7Mar 24, 2026 13:59100,567849,411,994711,699,000112,952,0002,334,720
8Mar 24, 2026 13:59112,522946,372,724804,851,000117,831,0002,400,256
9Mar 24, 2026 13:59118,7261,000,640,186861,607,000111,948,0002,281,472