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 06:07poilonpoilonScore: 17,206Success
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 06:0716,817149,910,073138,573,0001,011,0002,113,536
2May 19, 2026 06:0717,144153,172,446141,288,0001,012,0002,113,536
3May 19, 2026 06:0717,145153,474,752141,293,0001,011,0002,113,536
4May 19, 2026 06:0717,188153,923,155141,653,0001,011,0002,113,536
5May 19, 2026 06:0717,206153,834,945141,800,0001,012,0002,113,536
6May 19, 2026 06:0717,265153,626,336142,294,0001,013,0002,113,536
7May 19, 2026 06:0717,991160,507,073148,322,0001,010,0002,113,536
8May 19, 2026 06:0717,996159,744,436148,358,0001,011,0002,113,536
9May 19, 2026 06:0717,998161,068,467148,372,0001,012,0002,113,536