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 listAug 8, 2025 21:25Ashish AhujaAshish AhujaScore: 2,292,718Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 8, 2025 21:252,291,80219,067,192,53118,634,165,000387,795,0002,420,736
2Aug 8, 2025 21:252,292,71819,078,035,35118,633,779,000395,782,0002,416,640
3Aug 8, 2025 21:252,293,66819,087,034,88518,664,648,000372,793,0002,347,008