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 listSep 23, 2026 07:15Kevin HeaveyKevin HeaveyScore: 3,352Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 07:193,32536,424,17826,467,0001,136,0002,113,536
2Sep 23, 2026 07:193,33036,491,80126,497,0001,144,0002,113,536
3Sep 23, 2026 07:193,33737,308,65026,493,0001,209,0002,113,536
4Sep 23, 2026 07:193,34638,695,29926,748,0001,026,0002,113,536
5Sep 23, 2026 07:193,35237,425,87326,801,0001,028,0002,113,536
6Sep 23, 2026 07:193,35436,428,14726,797,0001,046,0002,113,536
7Sep 23, 2026 07:193,35537,459,11926,770,0001,080,0002,113,536
8Sep 23, 2026 07:193,35637,390,62526,828,0001,031,0002,113,536
9Sep 23, 2026 07:193,35936,534,92626,837,0001,046,0002,113,536