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 listSep 6, 2026 10:59Kevin HeaveyKevin HeaveyScore: 3,858Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 11:003,58639,874,32428,553,0001,216,0002,113,536
2Sep 6, 2026 11:003,59339,793,25228,658,0001,165,0002,113,536
3Sep 6, 2026 11:003,65140,366,37929,155,0001,156,0002,113,536
4Sep 6, 2026 11:003,82041,654,47930,568,0001,143,0002,113,536
5Sep 6, 2026 11:003,85842,735,46630,850,0001,172,0002,113,536
6Sep 6, 2026 11:003,86342,140,34830,889,0001,181,0002,113,536
7Sep 6, 2026 11:003,86343,104,27331,022,0001,044,0002,113,536
8Sep 6, 2026 11:003,88243,015,81031,183,0001,041,0002,113,536
9Sep 6, 2026 11:003,89242,356,15131,189,0001,122,0002,113,536