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 listApr 1, 2026 12:34zielajzielajScore: 3,547Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 1, 2026 12:343,41556,712,35427,333,0001,012,0002,428,928
2Apr 1, 2026 12:343,42847,608,06527,440,0001,016,0002,519,040
3Apr 1, 2026 12:343,48548,325,04727,891,0001,033,0002,433,024
4Apr 1, 2026 12:343,54750,306,44628,427,0001,015,0002,531,328
5Apr 1, 2026 12:343,68255,012,32429,545,0001,018,0002,433,024
6Apr 1, 2026 12:343,72056,018,97328,884,0001,992,0002,519,040