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 listAug 30, 2026 17:58Josu San MartinJosu San MartinScore: 4,579Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 17:584,56246,293,31436,838,0001,029,0002,113,536
2Aug 30, 2026 17:584,56646,306,33136,875,0001,025,0002,113,536
3Aug 30, 2026 17:584,56846,433,05636,803,0001,114,0002,113,536
4Aug 30, 2026 17:584,57546,412,63436,943,0001,037,0002,113,536
5Aug 30, 2026 17:584,57946,439,17036,954,0001,053,0002,113,536
6Aug 30, 2026 17:584,60946,761,78237,119,0001,143,0002,113,536
7Aug 30, 2026 17:584,62246,855,86937,243,0001,126,0002,113,536
8Aug 30, 2026 17:584,63046,857,12537,315,0001,121,0002,113,536
9Aug 30, 2026 17:584,67647,333,29337,700,0001,112,0002,113,536