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 listJul 8, 2026 03:28Victor MerckléVictor MerckléScore: 2,946Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 03:292,92031,836,74022,805,0001,142,0002,117,632stderr
2Jul 8, 2026 03:292,93232,153,90122,916,0001,130,0002,117,632stderr
3Jul 8, 2026 03:292,93332,140,43522,936,0001,115,0002,117,632stderr
4Jul 8, 2026 03:292,94532,036,85322,962,0001,195,0002,117,632stderr
5Jul 8, 2026 03:292,94632,023,39023,051,0001,114,0002,117,632stderr
6Jul 8, 2026 03:2911,758104,363,37895,409,0001,008,0002,117,632stderr
7Jul 8, 2026 03:2911,778104,503,51995,571,0001,010,0002,117,632stderr
8Jul 8, 2026 03:2911,803104,757,28795,775,0001,010,0002,117,632stderr
9Jul 8, 2026 03:2911,896105,516,83396,539,0001,010,0002,117,632stderr