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 20, 2026 15:25BenBenScore: 25,275Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 15:2625,240236,508,384202,481,0007,016,0002,330,624
2Apr 20, 2026 15:2625,275236,094,999197,799,00011,987,0002,334,720
3Apr 20, 2026 15:2625,528235,986,765203,892,0007,995,0002,371,584