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 4, 2025 14:03Rajarshi BasuRajarshi BasuScore: 10,274Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 4, 2025 14:0310,047104,204,49382,384,0001,004,0002,289,664
2Dec 4, 2025 14:0310,049105,956,51882,400,0001,004,0002,289,664
3Dec 4, 2025 14:0310,154111,524,99982,269,0002,006,0002,498,560
4Dec 4, 2025 14:0310,274108,234,44283,267,0002,006,0002,490,368
5Dec 4, 2025 14:0310,297107,798,85084,461,0001,005,0002,486,272
6Dec 4, 2025 14:0310,297113,283,18184,461,0001,005,0002,289,664