Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listMar 18, 2026 19:20Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 03:19Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 03:19045,347,51536,416,0001,048,0002,117,632expected "74600294196621100 ", got "16895846256258860 "
2Jul 7, 2026 03:19045,360,73436,477,0001,019,0002,117,632expected "74600294196621100 ", got "15171594095738912 "
3Jul 7, 2026 03:19045,515,59036,525,0001,049,0002,117,632expected "74600294196621100 ", got "15171666185858860 "
4Mar 18, 2026 19:204,74957,181,01537,399,0002,021,0002,265,088
5Mar 18, 2026 19:204,75361,734,45236,418,0003,034,0002,469,888
6Mar 18, 2026 19:204,80163,433,19536,861,0002,988,0002,527,232