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 3, 2026 18:16boop34boop34Score: 8,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 3, 2026 18:168,88783,632,30672,642,0001,124,0002,113,536
2Aug 3, 2026 18:168,89183,726,87172,693,0001,105,0002,113,536
3Aug 3, 2026 18:168,89583,690,87772,647,0001,185,0002,113,536
4Aug 3, 2026 18:168,89783,756,72672,648,0001,199,0002,113,536
5Aug 3, 2026 18:168,90083,723,62172,760,0001,118,0002,113,536
6Aug 3, 2026 18:168,90983,880,05672,741,0001,208,0002,113,536
7Aug 3, 2026 18:168,91683,793,74172,861,0001,143,0002,113,536
8Aug 3, 2026 18:168,91983,920,92472,929,0001,100,0002,113,536
9Aug 3, 2026 18:169,05285,016,99274,022,0001,117,0002,113,536