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 listApr 25, 2025 20:50nnScore: 395,208Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2025 20:50394,6313,309,089,9863,216,464,00058,971,0002,359,296
2Apr 25, 2025 20:50395,2083,308,310,2003,199,268,00080,956,0002,285,568
3Apr 25, 2025 20:50396,3823,314,144,1423,224,012,00065,959,0002,285,568