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 12, 2026 20:16Josu San MartinJosu San MartinScore: 11,195Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 12, 2026 20:163,33557,352,35725,319,0002,025,0002,265,088
2Mar 12, 2026 20:163,37461,480,52626,646,0001,024,0002,416,640
3Mar 12, 2026 20:1611,189118,491,26291,752,00002,383,872
4Mar 12, 2026 20:1611,190115,660,07489,760,0001,994,0002,322,432
5Mar 12, 2026 20:1611,195118,606,51389,808,0001,995,0002,351,104
6Mar 12, 2026 20:1611,197116,429,94988,821,0002,993,0002,375,680
7Mar 12, 2026 20:1611,210117,739,44788,923,0002,997,0002,387,968
8Mar 12, 2026 20:1611,248119,756,47990,228,0002,005,0002,375,680
9Mar 12, 2026 20:1611,248117,227,99792,236,00002,347,008