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 listMay 10, 2026 03:26Josu San MartinJosu San MartinScore: 4,553Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 03:274,52952,088,46636,493,0001,102,0002,551,808
2May 10, 2026 03:274,53455,065,79736,524,0001,113,0002,547,712
3May 10, 2026 03:274,53955,181,70236,519,0001,162,0002,543,616
4May 10, 2026 03:274,54953,934,30836,652,0001,105,0002,560,000
5May 10, 2026 03:274,55353,327,58536,666,0001,128,0002,547,712
6May 10, 2026 03:274,56655,509,94236,856,0001,047,0002,555,904
7May 10, 2026 03:274,58753,974,25336,958,0001,115,0002,543,616
8May 10, 2026 03:274,62055,745,46837,246,0001,105,0002,551,808
9May 10, 2026 03:274,68153,753,31937,744,0001,111,0002,547,712