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 listFeb 8, 2026 05:59howenhowenScore: 87,918Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 8, 2026 05:5987,088755,245,784488,885,000233,945,0002,473,984
2Feb 8, 2026 05:5987,308748,067,061490,768,000233,889,0002,478,080
3Feb 8, 2026 05:5987,328753,192,276488,878,000235,941,0002,289,664
4Feb 8, 2026 05:5987,591755,128,758489,330,000237,674,0002,457,600
5Feb 8, 2026 05:5987,918754,924,693488,812,000240,907,0002,486,272
6Feb 8, 2026 05:5987,973759,488,896489,446,000240,728,0002,326,528
7Feb 8, 2026 05:5988,021757,597,443488,713,000241,858,0002,289,664
8Feb 8, 2026 05:5988,092760,198,669488,443,000242,723,0002,293,760
9Feb 8, 2026 05:5988,564765,975,667490,390,000244,695,0002,355,200