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 07:18George SeabridgeGeorge SeabridgeScore: 8,528Success
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 07:198,48680,377,39369,364,0001,078,0002,113,536
2Aug 2, 2026 07:198,50780,630,90669,530,0001,082,0002,113,536
3Aug 2, 2026 07:198,51681,384,20469,604,0001,080,0002,113,536
4Aug 2, 2026 07:198,51680,608,97169,603,0001,087,0002,113,536
5Aug 2, 2026 07:198,52881,503,69769,699,0001,088,0002,113,536
6Aug 2, 2026 07:199,75490,827,29479,873,0001,089,0002,113,536
7Aug 2, 2026 07:199,78892,477,28080,152,0001,089,0002,113,536
8Aug 2, 2026 07:199,79791,191,69180,226,0001,091,0002,113,536
9Aug 2, 2026 07:199,81292,358,73080,306,0001,139,0002,113,536