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 listAug 30, 2026 18:55Josu San MartinJosu San MartinScore: 4,497Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 18:564,47945,703,59636,058,0001,125,0002,113,536
2Aug 30, 2026 18:564,48845,709,10936,143,0001,112,0002,113,536
3Aug 30, 2026 18:564,49345,898,55336,175,0001,125,0002,113,536
4Aug 30, 2026 18:564,49445,744,62536,181,0001,125,0002,113,536
5Aug 30, 2026 18:564,49745,797,57636,181,0001,145,0002,113,536
6Aug 30, 2026 18:564,50045,743,16836,222,0001,129,0002,113,536
7Aug 30, 2026 18:564,50145,840,72236,230,0001,134,0002,113,536
8Aug 30, 2026 18:564,50245,756,89136,254,0001,115,0002,113,536
9Aug 30, 2026 18:564,52346,045,21036,542,0001,007,0002,113,536