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 2, 2026 20:41TonyTonyScore: 9,288Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 20:419,17886,282,65573,690,0002,489,0002,113,536
2Aug 2, 2026 20:419,19786,682,00473,676,0002,660,0002,113,536
3Aug 2, 2026 20:419,21286,337,89973,988,0002,473,0002,113,536
4Aug 2, 2026 20:419,28487,219,65474,375,0002,689,0002,113,536
5Aug 2, 2026 20:419,28886,901,18874,592,0002,502,0002,113,536
6Aug 2, 2026 20:419,31187,114,69474,780,0002,504,0002,113,536
7Aug 2, 2026 20:419,34387,535,29974,885,0002,670,0002,113,536
8Aug 2, 2026 20:419,35987,955,50575,017,0002,670,0002,113,536
9Aug 2, 2026 20:419,43288,172,98475,626,0002,665,0002,113,536