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 18, 2026 17:20Kevin HeaveyKevin HeaveyScore: 3,948Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2026 17:303,66440,237,03029,367,0001,049,0002,113,536
2Jul 18, 2026 17:303,70240,503,68829,683,0001,048,0002,113,536
3Jul 18, 2026 17:303,74440,895,07529,988,0001,095,0002,113,536
4Jul 18, 2026 17:303,92642,417,38031,540,0001,047,0002,113,536
5Jul 18, 2026 17:303,94842,544,47731,728,0001,045,0002,113,536
6Jul 18, 2026 17:303,98342,887,06732,023,0001,043,0002,113,536
7Jul 18, 2026 17:303,98342,850,91032,018,0001,044,0002,117,632
8Jul 18, 2026 17:304,02043,318,77932,330,0001,043,0002,113,536
9Jul 18, 2026 17:304,05043,458,27932,580,0001,042,0002,113,536