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 13:36TudyMTudyMScore: 17,473Success
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 13:3917,415160,556,548140,808,0001,997,0002,367,488
2Apr 29, 2026 13:3917,431158,139,094140,941,0001,999,0002,375,680
3Apr 29, 2026 13:3917,459160,990,996142,169,0001,001,0002,363,392
4Apr 29, 2026 13:3917,467165,227,756142,229,0001,001,0002,363,392
5Apr 29, 2026 13:3917,473160,985,391142,278,0001,001,0002,363,392
6Apr 29, 2026 13:3917,491162,863,592142,427,0001,003,0002,367,488
7Apr 29, 2026 13:3917,496163,496,088140,486,0002,989,0002,363,392
8Apr 29, 2026 13:3917,579161,646,021142,148,0002,002,0002,375,680
9Apr 29, 2026 13:3917,590164,760,847143,238,0001,001,0002,371,584