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 13:40Kevin HeaveyKevin HeaveyScore: 3,730Success
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 13:523,66540,314,83329,374,0001,048,0002,113,536
2Jul 17, 2026 13:523,67140,336,89829,429,0001,047,0002,113,536
3Jul 17, 2026 13:523,67242,896,68229,431,0001,047,0002,113,536
4Jul 17, 2026 13:523,70540,597,90229,704,0001,048,0002,113,536
5Jul 17, 2026 13:523,73040,891,09929,882,0001,083,0002,113,536
6Jul 17, 2026 13:523,83841,657,20830,815,0001,045,0002,113,536
7Jul 17, 2026 13:523,94242,552,60631,678,0001,044,0002,113,536
8Jul 17, 2026 13:523,95142,596,71631,748,0001,046,0002,113,536
9Jul 17, 2026 13:524,02143,170,49632,339,0001,042,0002,113,536