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 23:08Josu San MartinJosu San MartinScore: 3,117Success
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 23:083,09835,334,50924,369,0001,039,0002,121,728stderr
2Sep 3, 2026 23:083,10535,332,02524,414,0001,049,0002,121,728stderr
3Sep 3, 2026 23:083,10936,193,57324,472,0001,024,0002,121,728stderr
4Sep 3, 2026 23:083,11543,206,84224,506,0001,038,0002,121,728stderr
5Sep 3, 2026 23:083,11735,499,22824,531,0001,035,0002,121,728stderr
6Sep 3, 2026 23:083,12835,655,78024,628,0001,028,0002,121,728stderr
7Sep 3, 2026 23:083,13735,739,44724,697,0001,030,0002,121,728stderr
8Sep 3, 2026 23:083,15135,795,65824,808,0001,035,0002,121,728stderr
9Sep 3, 2026 23:0815,311135,553,240124,550,0001,008,0002,121,728stderr