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 09:32Kevin HeaveyKevin HeaveyScore: 3,805Success
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 09:353,52637,596,46428,230,0001,043,0002,113,536
2Sep 6, 2026 09:353,52737,547,93328,073,0001,204,0002,113,536
3Sep 6, 2026 09:353,52837,570,59428,063,0001,227,0002,113,536
4Sep 6, 2026 09:353,65038,556,72529,103,0001,198,0002,113,536
5Sep 6, 2026 09:353,80539,858,82530,391,0001,195,0002,113,536
6Sep 6, 2026 09:353,81539,998,28930,460,0001,210,0002,113,536
7Sep 6, 2026 09:353,81849,053,83730,635,0001,055,0002,113,536
8Sep 6, 2026 09:353,85140,266,97130,930,0001,035,0002,113,536
9Sep 6, 2026 09:353,86540,417,02030,911,0001,174,0002,113,536