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 8, 2025 00:09Shikhar SoniShikhar SoniScore: 397,008Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 8, 2025 00:09395,0003,309,309,2173,211,534,00066,969,0002,289,664
2Dec 8, 2025 00:09395,0073,302,787,0493,193,599,00084,962,0002,506,752
3Dec 8, 2025 00:09396,6073,323,519,3773,226,884,00064,957,0002,281,472
4Dec 8, 2025 00:09396,8003,317,422,0523,226,474,00066,968,0002,285,568
5Dec 8, 2025 00:09397,0083,323,400,3713,236,200,00058,967,0002,506,752
6Dec 8, 2025 00:09397,7283,334,576,4543,215,190,00085,951,0002,285,568
7Dec 8, 2025 00:09401,0793,357,160,0243,258,003,00070,956,0002,285,568
8Dec 8, 2025 00:09401,8233,362,933,3963,257,175,00077,956,0002,289,664
9Dec 8, 2025 00:09404,9713,392,419,4253,284,296,00076,960,0002,498,560