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 17, 2026 13:49flavio87flavio87Score: 4,615Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 13:514,23643,443,25734,122,0001,038,0002,113,536
2Aug 17, 2026 13:514,31344,012,07734,755,0001,048,0002,113,536
3Aug 17, 2026 13:514,50946,376,26536,420,0001,010,0002,113,536
4Aug 17, 2026 13:514,52845,920,58536,555,0001,031,0002,113,536
5Aug 17, 2026 13:514,61546,615,67537,285,0001,023,0002,113,536
6Aug 17, 2026 13:514,62447,564,27937,370,0001,010,0002,113,536
7Aug 17, 2026 13:514,67447,703,84237,787,0001,015,0002,113,536
8Aug 17, 2026 13:514,67956,934,98837,789,0001,051,0002,113,536
9Aug 17, 2026 13:514,76457,893,70138,454,0001,092,0002,113,536