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 listDec 15, 2025 12:41AndreiAndreiScore: 149,079Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 15, 2025 12:41148,9251,264,422,0621,178,073,00058,003,0002,289,664
2Dec 15, 2025 12:41149,0311,259,557,5131,179,962,00056,998,0002,498,560
3Dec 15, 2025 12:41149,0471,270,358,2191,192,085,00045,003,0002,289,664
4Dec 15, 2025 12:41149,0651,263,422,2311,180,276,00056,965,0002,531,328
5Dec 15, 2025 12:41149,0791,262,153,5791,185,385,00051,973,0002,531,328
6Dec 15, 2025 12:41149,1341,261,462,7071,188,821,00048,992,0002,297,856
7Dec 15, 2025 12:41149,1381,259,559,5501,177,851,00059,992,0002,285,568
8Dec 15, 2025 12:41149,1531,266,232,1871,183,971,00053,998,0002,293,760
9Dec 15, 2025 12:41165,1261,399,956,0231,313,568,00056,981,0002,523,136