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 listJul 17, 2026 14:39Kevin HeaveyKevin HeaveyScore: 3,699Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2026 14:533,66840,212,79029,406,0001,045,0002,113,536
2Jul 17, 2026 14:533,67340,266,70129,437,0001,049,0002,113,536
3Jul 17, 2026 14:533,69840,661,92629,644,0001,053,0002,113,536
4Jul 17, 2026 14:533,69940,483,00329,648,0001,058,0002,113,536
5Jul 17, 2026 14:533,69940,547,60529,652,0001,051,0002,113,536
6Jul 17, 2026 14:533,70340,615,72229,692,0001,047,0002,113,536
7Jul 17, 2026 14:533,91242,404,80531,426,0001,045,0002,113,536
8Jul 17, 2026 14:533,96942,797,67831,901,0001,046,0002,113,536
9Jul 17, 2026 14:533,98942,978,70431,960,0001,151,0002,113,536