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 6, 2026 09:29Kevin HeaveyKevin HeaveyScore: 3,554Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 09:313,51939,360,09428,139,0001,075,0002,113,536
2Sep 6, 2026 09:313,53539,596,37328,303,0001,042,0002,113,536
3Sep 6, 2026 09:313,54937,931,66828,254,0001,203,0002,113,536
4Sep 6, 2026 09:313,55039,253,05428,413,0001,055,0002,113,536
5Sep 6, 2026 09:313,55439,561,07628,461,0001,041,0002,113,536
6Sep 6, 2026 09:313,60038,383,03428,680,0001,200,0002,113,536
7Sep 6, 2026 09:313,73639,365,12129,824,0001,193,0002,113,536
8Sep 6, 2026 09:313,83242,685,07730,756,0001,057,0002,113,536
9Sep 6, 2026 09:313,85942,761,70330,952,0001,079,0002,113,536