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 listFeb 20, 2026 23:05Josu San MartinJosu San MartinScore: 5,782Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 20, 2026 23:055,35561,504,14343,438,0001,010,0002,289,664
2Feb 20, 2026 23:055,52070,930,59944,821,000996,0002,289,664
3Feb 20, 2026 23:055,55275,716,98944,079,0002,003,0002,355,200
4Feb 20, 2026 23:055,78274,584,86646,991,000999,0002,297,856
5Feb 20, 2026 23:055,84776,851,70247,517,0001,011,0002,359,296
6Feb 20, 2026 23:055,87981,374,09345,811,0002,987,0002,363,392