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 listMay 19, 2026 16:23Milo PresedoMilo PresedoScore: 8,004Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 16:247,99274,252,79065,137,0001,198,0002,113,536
2May 19, 2026 16:247,99374,537,58265,120,0001,223,0002,113,536
3May 19, 2026 16:247,99575,998,95665,160,0001,199,0002,113,536
4May 19, 2026 16:248,00075,531,93165,218,0001,188,0002,113,536
5May 19, 2026 16:248,00475,800,25065,249,0001,192,0002,113,536
6May 19, 2026 16:248,00575,335,41765,224,0001,220,0002,113,536
7May 19, 2026 16:248,00775,028,49765,297,0001,163,0002,113,536
8May 19, 2026 16:248,01176,478,25965,481,0001,017,0002,113,536
9May 19, 2026 16:248,37180,113,61568,292,0001,194,0002,113,536