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:17George SeabridgeGeorge SeabridgeScore: 9,568Success
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:188,49080,422,41469,464,0001,009,0002,113,536
2Aug 2, 2026 07:188,50380,488,74669,500,0001,080,0002,113,536
3Aug 2, 2026 07:188,50780,579,41869,524,0001,085,0002,113,536
4Aug 2, 2026 07:188,52380,624,24669,660,0001,089,0002,113,536
5Aug 2, 2026 07:189,56889,552,19778,251,0001,167,0002,113,536
6Aug 2, 2026 07:189,79491,266,23780,054,0001,237,0002,113,536
7Aug 2, 2026 07:189,79691,194,98280,296,0001,011,0002,113,536
8Aug 2, 2026 07:189,81091,379,60180,332,0001,097,0002,113,536
9Aug 2, 2026 07:189,81091,339,91680,333,0001,091,0002,113,536