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 20, 2026 12:13wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 17:17Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 17:17038,389,60129,536,0001,010,0002,113,536expected "74600294196621100 ", got "74594483817251377 "
2Jul 6, 2026 17:17037,384,76928,520,0001,011,0002,113,536expected "74600294196621100 ", got "74594301737573577 "
3Jul 6, 2026 17:17037,318,29227,974,0001,040,0002,113,536expected "74600294196621100 ", got "74924941379371898 "
4Apr 20, 2026 12:133,56761,516,93028,592,0001,021,0002,461,696
5Apr 20, 2026 12:133,57158,408,77328,624,0001,022,0002,465,792
6Apr 20, 2026 12:133,57257,844,36928,629,0001,022,0002,269,184