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 15:18Kevin HeaveyKevin HeaveyScore: 3,797Success
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 15:373,66840,295,76229,405,0001,046,0002,113,536
2Jul 17, 2026 15:373,66840,228,74829,397,0001,049,0002,113,536
3Jul 17, 2026 15:373,67340,350,34029,442,0001,051,0002,113,536
4Jul 17, 2026 15:373,71240,608,51429,765,0001,045,0002,113,536
5Jul 17, 2026 15:373,79741,331,84230,476,0001,044,0002,113,536
6Jul 17, 2026 15:373,89442,135,78131,284,0001,043,0002,113,536
7Jul 17, 2026 15:373,90942,341,10731,401,0001,045,0002,113,536
8Jul 17, 2026 15:373,93842,526,88231,647,0001,045,0002,113,536
9Jul 17, 2026 15:373,96342,722,47331,854,0001,046,0002,113,536