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 listSep 14, 2026 15:33Kevin HeaveyKevin HeaveyScore: 3,567Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 15:343,54839,398,11728,248,0001,201,0002,113,536
2Sep 14, 2026 15:343,55138,257,15428,283,0001,197,0002,113,536
3Sep 14, 2026 15:343,56138,308,41028,339,0001,218,0002,113,536
4Sep 14, 2026 15:343,56738,347,27128,403,0001,210,0002,113,536
5Sep 14, 2026 15:343,56738,396,85028,401,0001,210,0002,113,536
6Sep 14, 2026 15:343,57338,503,50828,629,0001,033,0002,113,536
7Sep 14, 2026 15:343,57738,488,97728,473,0001,218,0002,113,536
8Sep 14, 2026 15:343,73840,506,14029,990,0001,042,0002,113,536
9Sep 14, 2026 15:343,80740,358,46930,408,0001,191,0002,113,536