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 11:07Kevin HeaveyKevin HeaveyScore: 3,731Success
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:083,56938,106,09628,550,0001,075,0002,113,536
2Sep 6, 2026 11:083,61538,506,92828,757,0001,251,0002,113,536
3Sep 6, 2026 11:083,66539,031,35929,384,0001,041,0002,113,536
4Sep 6, 2026 11:083,72139,466,95529,818,0001,074,0002,113,536
5Sep 6, 2026 11:083,73139,488,28229,939,0001,034,0002,113,536
6Sep 6, 2026 11:083,74739,699,87230,048,0001,055,0002,113,536
7Sep 6, 2026 11:083,82340,371,12630,699,0001,032,0002,113,536
8Sep 6, 2026 11:083,83642,006,98830,789,0001,052,0002,113,536
9Sep 6, 2026 11:083,86340,719,17831,024,0001,045,0002,113,536