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:20Josu 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:20051,896,79433,275,0001,043,0002,482,176expected "53685366741432790 ", got "53685366679150734 "
2May 10, 2026 05:20046,956,23333,199,0001,062,0002,478,080expected "53686903008344183 ", got "53686902735167215 "
3May 10, 2026 05:204,10748,944,81732,969,0001,121,0002,478,080
4May 10, 2026 05:204,11551,371,57533,026,0001,130,0002,482,176
5May 10, 2026 05:204,11851,390,76733,138,0001,048,0002,486,272
6May 10, 2026 05:204,12150,441,66033,167,0001,045,0002,490,368
7May 10, 2026 05:204,12750,796,51333,193,0001,065,0002,469,888
8May 10, 2026 05:204,14351,706,64933,339,0001,053,0002,490,368
9May 10, 2026 05:204,16350,857,94033,537,0001,023,0002,486,272