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 18:12marko1597marko1597Score: 5,877Success
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 18:344,82948,544,43038,969,0001,112,0002,117,632
2Aug 16, 2026 18:344,85148,676,00339,144,0001,120,0002,117,632
3Aug 16, 2026 18:344,86348,803,65939,257,0001,111,0002,117,632
4Aug 16, 2026 18:344,91749,294,01239,687,0001,127,0002,117,632
5Aug 16, 2026 18:345,87757,260,16247,651,0001,131,0002,117,632
6Aug 16, 2026 18:346,29860,695,06451,237,0001,042,0002,117,632
7Aug 16, 2026 18:346,51762,505,69252,955,0001,139,0002,117,632
8Aug 16, 2026 18:346,67063,764,41454,304,0001,063,0002,117,632
9Aug 16, 2026 18:346,77564,631,53355,117,0001,121,0002,117,632