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 18, 2026 23:03Aleksei ShahoikaAleksei ShahoikaScore: 11,540Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 23:0411,481105,702,25574,021,00021,275,0002,113,536
2May 18, 2026 23:0411,483108,116,18374,056,00021,259,0002,113,536
3May 18, 2026 23:0411,484107,242,22374,036,00021,285,0002,113,536
4May 18, 2026 23:0411,534108,586,30374,246,00021,489,0002,113,536
5May 18, 2026 23:0411,540105,308,03874,007,00021,781,0002,113,536
6May 18, 2026 23:0411,567106,525,35374,070,00021,941,0002,113,536
7May 18, 2026 23:0411,600112,252,35574,227,00022,061,0002,113,536
8May 18, 2026 23:0411,673107,147,76074,181,00022,712,0002,113,536
9May 18, 2026 23:0411,717108,378,52174,170,00023,086,0002,113,536