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 19, 2026 00:57Josu San MartinJosu San MartinScore: 6,243Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 00:576,08774,110,67950,524,00002,514,944
2Feb 19, 2026 00:576,13075,113,31048,888,0001,995,0002,433,024
3Feb 19, 2026 00:576,13370,903,87848,906,0001,996,0002,428,928
4Feb 19, 2026 00:576,24376,258,85048,831,0002,989,0002,297,856
5Feb 19, 2026 00:576,27779,299,68850,098,0002,003,0002,473,984
6Feb 19, 2026 00:576,36780,306,25350,856,0001,994,0002,297,856