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 15, 2026 16:48Maya RebholzMaya RebholzScore: 8,239Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2026 16:498,07075,888,72763,657,0002,517,0002,113,536
2Jul 15, 2026 16:498,10376,326,33363,913,0002,539,0002,113,536
3Jul 15, 2026 16:498,11976,884,21864,166,0002,412,0002,113,536
4Jul 15, 2026 16:498,17077,010,35264,452,0002,550,0002,113,536
5Jul 15, 2026 16:498,23977,403,59365,182,0002,385,0002,113,536
6Jul 15, 2026 16:498,30577,932,83565,577,0002,530,0002,113,536
7Jul 15, 2026 16:498,32478,030,01665,712,0002,546,0002,113,536
8Jul 15, 2026 16:498,39878,638,90966,291,0002,573,0002,113,536
9Jul 15, 2026 16:498,47379,900,18167,055,0002,430,0002,113,536