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 21:35zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 00:06Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 00:06063,034,94755,034,00002,113,536expected "45503067319964806 ", got "43644965598008454 "
2Jul 4, 2026 00:06064,297,68956,330,00002,113,536expected "45498613366706255 ", got "43640478798827599 "
3Jul 4, 2026 00:06062,849,07955,050,00002,113,536expected "45491903824670562 ", got "43633709552840546 "
4Apr 12, 2026 21:353,40848,361,11727,275,0001,010,0002,519,040
5Apr 12, 2026 21:353,40950,086,53527,284,0001,010,0002,519,040
6Apr 12, 2026 21:353,41346,412,80827,313,0001,011,0002,424,832