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 21, 2026 10:14Kevin HeaveyKevin HeaveyScore: 3,577Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 21, 2026 10:213,55839,334,60628,486,0001,048,0002,113,536
2Jul 21, 2026 10:213,56339,384,29528,533,0001,047,0002,113,536
3Jul 21, 2026 10:213,56742,095,32128,561,0001,046,0002,113,536
4Jul 21, 2026 10:213,57139,478,36828,597,0001,047,0002,113,536
5Jul 21, 2026 10:213,57739,645,67428,654,0001,036,0002,113,536
6Jul 21, 2026 10:213,57939,571,48228,660,0001,047,0002,113,536
7Jul 21, 2026 10:213,75843,001,97830,151,0001,045,0002,113,536
8Jul 21, 2026 10:213,79141,910,61630,428,0001,043,0002,113,536
9Jul 21, 2026 10:213,84542,419,25430,873,0001,044,0002,113,536