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 10, 2026 07:48Josu San MartinJosu San MartinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 07:49052,082,99333,545,0001,044,0002,482,176expected "53686843960878957 ", got "53686846098339058 "
2May 10, 2026 07:494,12249,301,95133,108,0001,107,0002,486,272
3May 10, 2026 07:494,13050,876,73733,135,0001,149,0002,486,272
4May 10, 2026 07:494,13250,444,58433,155,0001,141,0002,490,368
5May 10, 2026 07:494,16152,143,76233,396,0001,144,0002,486,272
6May 10, 2026 07:494,16550,618,91733,508,0001,064,0002,490,368
7May 10, 2026 07:494,17450,502,69333,603,0001,042,0002,490,368
8May 10, 2026 07:494,18951,228,35233,701,0001,075,0002,486,272
9May 10, 2026 07:494,48653,373,27936,116,0001,118,0002,486,272