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 listMar 13, 2026 12:36Eric CeglieEric CeglieScore: 27,983Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 12:3627,962260,321,568231,088,0001,000,0002,265,088
2Mar 13, 2026 12:3627,966262,069,555231,120,0001,000,0002,285,568
3Mar 13, 2026 12:3627,983262,578,301230,260,0002,002,0002,285,568
4Mar 13, 2026 12:3627,983263,415,688230,261,0002,002,0002,285,568
5Mar 13, 2026 12:3627,983259,401,467232,261,00002,514,944
6Mar 13, 2026 12:3627,989251,417,178231,311,0001,001,0002,514,944
7Mar 13, 2026 12:3627,991256,775,686231,328,0001,001,0002,519,040
8Mar 13, 2026 12:3628,019259,860,812231,559,000998,0002,285,568
9Mar 13, 2026 12:3628,106258,647,817230,275,0003,003,0002,289,664