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 19, 2026 13:41Kevin HeaveyKevin HeaveyScore: 3,814Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 19, 2026 13:423,75740,876,36730,027,0001,161,0002,113,536
2Jul 19, 2026 13:423,78541,063,46430,283,0001,137,0002,113,536
3Jul 19, 2026 13:423,78641,099,56830,265,0001,167,0002,113,536
4Jul 19, 2026 13:423,79941,369,09530,408,0001,128,0002,113,536
5Jul 19, 2026 13:423,81441,520,51230,519,0001,144,0002,113,536
6Jul 19, 2026 13:423,87042,491,11530,902,0001,226,0002,113,536
7Jul 19, 2026 13:423,88442,474,59631,085,0001,156,0002,113,536
8Jul 19, 2026 13:423,92742,268,42731,389,0001,213,0002,113,536
9Jul 19, 2026 13:423,93542,945,56931,532,0001,134,0002,113,536