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 listApr 2, 2026 11:52zielajzielajScore: 3,435Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 2, 2026 11:533,42249,416,65527,389,0001,014,0002,473,984
2Apr 2, 2026 11:523,42647,819,42127,422,0001,015,0002,428,928
3Apr 2, 2026 11:533,43248,894,03527,471,0001,017,0002,433,024
4Apr 2, 2026 11:533,43549,220,85927,492,0001,018,0002,433,024
5Apr 2, 2026 11:523,43849,646,91127,515,0001,019,0002,519,040
6Apr 2, 2026 11:523,47851,691,37627,840,0001,031,0002,519,040