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

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 21:28Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 21:29041,752,61531,535,0001,149,0002,113,536expected "74600294196621100 ", got "74101776198838060 "
2Jul 6, 2026 21:29040,990,75131,658,0001,126,0002,113,536expected "74600294196621100 ", got "74112020872043820 "
3Jul 6, 2026 21:29041,252,11432,056,0001,127,0002,113,536expected "74600294196621100 ", got "74108048890975020 "
4Apr 12, 2026 12:194,20363,199,51832,891,0001,993,0002,277,376
5Apr 12, 2026 12:194,22358,352,89633,049,0002,002,0002,277,376
6Apr 12, 2026 12:194,25955,878,53933,331,0002,020,0002,277,376