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 06:15wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 17:41Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 17:42038,688,83629,727,0001,006,0002,113,536expected "74600294196621100 ", got "74534439833806490 "
2Jul 6, 2026 17:42038,845,18229,748,0001,029,0002,113,536expected "74600294196621100 ", got "74534441741842490 "
3Jul 6, 2026 17:42040,556,90731,442,0001,030,0002,113,536expected "74600294196621100 ", got "74535242051798970 "
4Apr 19, 2026 06:143,69752,524,65629,660,0001,022,0002,531,328
5Apr 19, 2026 06:143,71256,842,32828,824,0001,987,0002,531,328
6Apr 19, 2026 06:143,71553,672,81428,845,0001,989,0002,527,232
7Apr 19, 2026 06:153,71655,690,82029,848,000994,0002,531,328
8Apr 19, 2026 06:153,73155,120,15628,968,0001,997,0002,277,376
9Apr 19, 2026 06:153,74250,717,57629,053,0002,003,0002,277,376