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 16, 2026 19:14marko1597marko1597Score: 4,577Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 19:244,44945,179,56135,815,0001,115,0002,117,632
2Aug 16, 2026 19:244,45345,279,04335,863,0001,098,0002,117,632
3Aug 16, 2026 19:244,46045,243,96335,919,0001,105,0002,117,632
4Aug 16, 2026 19:244,48445,610,67936,080,0001,138,0002,117,632
5Aug 16, 2026 19:244,57746,246,83836,873,0001,117,0002,117,632
6Aug 16, 2026 19:244,58946,390,04936,955,0001,141,0002,117,632
7Aug 16, 2026 19:244,60546,587,69737,108,0001,121,0002,117,632
8Aug 16, 2026 19:244,61656,101,33837,093,0001,227,0002,117,632
9Aug 16, 2026 19:244,61758,042,80137,126,0001,198,0002,117,632