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 listSep 3, 2026 18:04Josu San MartinJosu San MartinScore: 15,857Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 18:053,73140,541,36629,403,0001,197,0002,117,632
2Sep 3, 2026 18:053,76040,790,18629,631,0001,203,0002,117,632
3Sep 3, 2026 18:053,77841,671,58229,697,0001,284,0002,117,632
4Sep 3, 2026 18:053,85153,263,65030,495,0001,091,0002,117,632
5Sep 3, 2026 18:0515,857139,899,630129,022,0001,007,0002,117,632
6Sep 3, 2026 18:0515,862139,989,030129,067,0001,006,0002,117,632
7Sep 3, 2026 18:0515,881140,981,614129,221,0001,011,0002,117,632
8Sep 3, 2026 18:0515,928140,571,255129,608,0001,008,0002,117,632
9Sep 3, 2026 18:0515,950140,794,857129,786,0001,009,0002,117,632