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 listMay 10, 2026 05:17Josu San MartinJosu San MartinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 05:17048,981,45633,097,0001,135,0002,482,176expected "53688437818760901 ", got "53688436069026503 "
2May 10, 2026 05:17048,069,58933,051,0001,132,0002,490,368expected "53688935947814899 ", got "53688935870146567 "
3May 10, 2026 05:174,11149,422,82933,002,0001,123,0002,486,272
4May 10, 2026 05:174,13150,129,89433,146,0001,143,0002,490,368
5May 10, 2026 05:174,13150,300,31333,175,0001,120,0002,478,080
6May 10, 2026 05:174,13151,820,21133,160,0001,128,0002,486,272
7May 10, 2026 05:174,15251,888,79633,318,0001,151,0002,486,272
8May 10, 2026 05:174,15451,434,53133,373,0001,110,0002,486,272
9May 10, 2026 05:174,16251,953,91033,482,0001,067,0002,482,176