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 listApr 14, 2026 08:46wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 20:09Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 20:09038,218,78528,937,0001,141,0002,113,536expected "74600294196621100 ", got "72494012178016556 "
2Jul 6, 2026 20:09037,446,50428,180,0001,104,0002,113,536expected "74600294196621100 ", got "72493630282773548 "
3Jul 6, 2026 20:09037,242,90828,113,0001,094,0002,113,536expected "74600294196621100 ", got "72473332623565100 "
4Apr 14, 2026 08:464,05458,468,01232,627,0001,019,0002,490,368
5Apr 14, 2026 08:464,10463,395,07532,061,0002,003,0002,490,368
6Apr 14, 2026 08:464,19770,527,81332,844,0001,990,0002,486,272