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 8, 2026 22:31zielajzielajScore: 3,641Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 8, 2026 22:313,43143,274,26227,374,0001,106,0002,428,928
2May 8, 2026 22:313,62547,193,28928,962,0001,128,0002,424,832
3May 8, 2026 22:313,63044,003,90729,020,0001,117,0002,428,928
4May 8, 2026 22:313,63544,588,17029,067,0001,106,0002,428,928
5May 8, 2026 22:313,64145,401,03129,120,0001,107,0002,428,928
6May 8, 2026 22:313,64444,000,41329,125,0001,127,0002,433,024
7May 8, 2026 22:313,64846,500,34129,177,0001,108,0002,424,832
8May 8, 2026 22:313,65043,951,95429,146,0001,154,0002,433,024
9May 8, 2026 22:313,66748,575,09729,301,0001,139,0002,428,928