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:32TonyTonyScore: 12,900Success
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:3212,749115,834,54682,958,00022,859,0002,113,536
2Aug 2, 2026 18:3212,834116,549,93183,354,00023,176,0002,113,536
3Aug 2, 2026 18:3212,880119,112,91283,696,00023,214,0002,113,536
4Aug 2, 2026 18:3212,894117,011,37684,021,00023,003,0002,113,536
5Aug 2, 2026 18:3212,900117,943,35983,868,00023,209,0002,113,536
6Aug 2, 2026 18:3212,918117,260,18884,284,00022,936,0002,113,536
7Aug 2, 2026 18:3212,922117,220,47084,085,00023,175,0002,113,536
8Aug 2, 2026 18:3212,936117,411,30484,202,00023,170,0002,113,536
9Aug 2, 2026 18:3212,954118,399,24584,121,00023,403,0002,113,536