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 10:19Kevin HeaveyKevin HeaveyScore: 3,532Success
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 10:203,51739,057,78028,157,0001,037,0002,113,536
2Sep 6, 2026 10:203,52740,016,88328,040,0001,239,0002,113,536
3Sep 6, 2026 10:203,52739,912,17228,049,0001,229,0002,113,536
4Sep 6, 2026 10:203,53239,711,57228,075,0001,246,0002,113,536
5Sep 6, 2026 10:203,53239,683,28228,287,0001,035,0002,113,536
6Sep 6, 2026 10:203,54237,767,90628,169,0001,235,0002,113,536
7Sep 6, 2026 10:203,55537,895,93828,473,0001,039,0002,113,536
8Sep 6, 2026 10:203,75340,951,19630,114,0001,040,0002,113,536
9Sep 6, 2026 10:203,79042,404,58430,233,0001,228,0002,113,536