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 28, 2026 08:52Victor MerckléVictor MerckléScore: 32,221Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 08:5331,860278,050,984260,258,0001,000,0002,326,528
2Apr 28, 2026 08:5331,860278,095,496260,254,0001,000,0002,322,432
3Apr 28, 2026 08:5332,012282,524,734261,504,0001,001,0002,330,624
4Apr 28, 2026 08:5332,181276,349,432260,888,0002,998,0002,326,528
5Apr 28, 2026 08:5332,221282,431,248263,215,0001,000,0002,379,776
6Apr 28, 2026 08:5332,335287,743,537264,148,0001,000,0002,379,776
7Apr 28, 2026 08:5332,467289,359,844265,231,0001,000,0002,371,584
8Apr 28, 2026 08:5332,637284,574,401265,631,0001,997,0002,322,432
9Apr 28, 2026 08:5332,683281,672,659267,003,0001,000,0002,379,776