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 03:49Josu San MartinJosu San MartinScore: 4,393Success
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 03:494,38954,054,18435,405,0001,031,0002,555,904
2May 10, 2026 03:494,39153,729,97135,424,0001,029,0002,560,000
3May 10, 2026 03:494,39252,823,20235,420,0001,037,0002,547,712
4May 10, 2026 03:494,39254,757,89035,434,0001,020,0002,547,712
5May 10, 2026 03:494,39354,482,33435,427,0001,036,0002,551,808
6May 10, 2026 03:494,39350,494,79335,289,0001,179,0002,551,808
7May 10, 2026 03:494,39452,510,01835,288,0001,184,0002,547,712
8May 10, 2026 03:494,39652,728,54035,460,0001,029,0002,551,808
9May 10, 2026 03:494,44653,137,20035,867,0001,039,0002,297,856