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 14, 2026 13:42marko1597marko1597Score: 7,251Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 13:437,24669,973,93759,087,0001,058,0002,113,536
2Aug 14, 2026 13:437,24970,086,49759,089,0001,078,0002,113,536
3Aug 14, 2026 13:437,24969,993,03359,160,0001,012,0002,113,536
4Aug 14, 2026 13:437,24970,085,56859,101,0001,068,0002,113,536
5Aug 14, 2026 13:437,25170,004,84559,120,0001,065,0002,113,536
6Aug 14, 2026 13:437,26870,229,39359,190,0001,138,0002,113,536
7Aug 14, 2026 13:437,28170,304,40659,419,0001,016,0002,113,536
8Aug 14, 2026 13:437,30670,441,00159,575,0001,065,0002,113,536
9Aug 14, 2026 13:437,43771,641,39360,674,0001,054,0002,113,536