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 19, 2026 04:19wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 17:44Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 17:44039,158,16430,133,0001,010,0002,113,536expected "74600294196621100 ", got "74535240008762970 "
2Jul 6, 2026 17:44039,681,20130,520,0001,037,0002,113,536expected "74600294196621100 ", got "74534441577689170 "
3Jul 6, 2026 17:44038,804,55929,827,0001,018,0002,113,536expected "74600294196621100 ", got "74534439878752490 "
4Apr 19, 2026 04:193,72153,895,13428,894,0001,992,0002,531,328
5Apr 19, 2026 04:193,72555,772,98328,922,0001,994,0002,498,560
6Apr 19, 2026 04:193,84953,564,39129,948,0001,996,0002,527,232