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 08:32George SeabridgeGeorge SeabridgeScore: 69,848Success
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 08:3269,598587,579,176576,583,0001,081,0002,113,536
2Aug 2, 2026 08:3269,668588,180,309577,164,0001,083,0002,113,536
3Aug 2, 2026 08:3269,676588,202,646577,226,0001,086,0002,113,536
4Aug 2, 2026 08:3269,804589,271,415578,280,0001,098,0002,113,536
5Aug 2, 2026 08:3269,848589,660,455578,649,0001,096,0002,113,536
6Aug 2, 2026 08:3269,884591,749,185578,906,0001,134,0002,113,536
7Aug 2, 2026 08:3282,198692,226,270681,100,0001,144,0002,113,536
8Aug 2, 2026 08:3289,903756,092,126745,110,0001,088,0002,113,536
9Aug 2, 2026 08:3296,742812,913,918801,867,0001,096,0002,113,536