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,344Success
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:233,33336,538,92526,508,0001,160,0002,113,536
2Sep 23, 2026 07:233,33736,510,28826,533,0001,169,0002,113,536
3Sep 23, 2026 07:233,33837,313,13226,654,0001,057,0002,113,536
4Sep 23, 2026 07:233,33836,392,83226,585,0001,124,0002,113,536
5Sep 23, 2026 07:233,34436,490,77326,598,0001,162,0002,113,536
6Sep 23, 2026 07:233,34536,512,88726,704,0001,060,0002,113,536
7Sep 23, 2026 07:233,34536,701,29926,724,0001,040,0002,113,536
8Sep 23, 2026 07:233,35136,597,76126,794,0001,020,0002,113,536
9Sep 23, 2026 07:233,35537,387,19426,819,0001,031,0002,113,536