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 7, 2026 18:43Kevin HeaveyKevin HeaveyScore: 4,080Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 18:433,99042,708,22932,078,0001,040,0002,117,632
2Jul 7, 2026 18:433,99242,647,54932,103,0001,038,0002,117,632
3Jul 7, 2026 18:434,07343,379,13832,771,0001,036,0002,117,632
4Jul 7, 2026 18:434,07952,326,63632,827,0001,036,0002,121,728
5Jul 7, 2026 18:434,08043,388,04632,819,0001,049,0002,117,632
6Jul 7, 2026 18:434,11250,775,83433,099,0001,035,0002,121,728
7Jul 7, 2026 18:434,15544,034,42433,453,0001,035,0002,117,632
8Jul 7, 2026 18:434,26444,900,61734,361,0001,035,0002,117,632
9Jul 7, 2026 18:434,35845,766,61035,145,0001,031,0002,117,632