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 11, 2026 01:46Josu 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 11, 2026 01:47042,469,14032,156,0001,070,0002,113,536expected "53676105160998658 ", got "53676110901768359 "
2May 11, 2026 01:473,98240,740,63031,972,0001,085,0002,113,536
3May 11, 2026 01:473,98443,161,06431,973,0001,100,0002,113,536
4May 11, 2026 01:473,99042,842,57232,049,0001,076,0002,113,536
5May 11, 2026 01:473,99940,866,92932,118,0001,075,0002,113,536
6May 11, 2026 01:474,01541,024,89432,252,0001,076,0002,113,536
7May 11, 2026 01:474,02142,282,60332,289,0001,093,0002,113,536
8May 11, 2026 01:474,02343,614,53632,310,0001,083,0002,113,536
9May 11, 2026 01:474,02741,418,13332,350,0001,080,0002,113,536