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 08:09wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 17:38Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 17:38041,142,24031,466,0001,006,0002,113,536expected "74600294196621100 ", got "74526986873133477 "
2Jul 6, 2026 17:38036,933,06127,995,0001,026,0002,113,536expected "74600294196621100 ", got "74924948860551028 "
3Jul 6, 2026 17:38036,618,72127,705,0001,023,0002,113,536expected "74600294196621100 ", got "74924938794651018 "
4Apr 19, 2026 08:093,66856,994,89529,433,0001,014,0002,494,464
5Apr 19, 2026 08:093,69154,363,21328,663,0001,976,0002,277,376
6Apr 19, 2026 08:093,69556,700,78129,649,0001,022,0002,498,560