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 18:19TonyTonyScore: 12,046Success
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 18:2011,982109,317,68376,652,00022,799,0002,113,536
2Aug 2, 2026 18:2012,014109,593,11176,905,00022,817,0002,113,536
3Aug 2, 2026 18:2012,022109,614,56976,993,00022,792,0002,113,536
4Aug 2, 2026 18:2012,045109,858,05277,225,00022,753,0002,113,536
5Aug 2, 2026 18:2012,046109,771,12477,044,00022,941,0002,113,536
6Aug 2, 2026 18:2012,057109,918,66377,069,00023,005,0002,113,536
7Aug 2, 2026 18:2012,078110,198,19177,352,00022,901,0002,113,536
8Aug 2, 2026 18:2012,094110,299,87977,477,00022,905,0002,113,536
9Aug 2, 2026 18:2012,103110,380,62977,718,00022,745,0002,113,536