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 listMay 13, 2026 11:58Victor MerckléVictor MerckléScore: 8,069Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 11:588,06173,997,69665,876,0001,035,0002,113,536
2May 13, 2026 11:588,06375,080,74965,884,0001,045,0002,113,536
3May 13, 2026 11:588,06576,286,48766,942,00002,113,536
4May 13, 2026 11:588,06975,141,29665,931,0001,046,0002,113,536
5May 13, 2026 11:588,06976,768,06465,954,0001,019,0002,113,536
6May 13, 2026 11:588,07174,300,48765,977,0001,016,0002,113,536
7May 13, 2026 11:588,07575,379,04966,005,0001,020,0002,113,536
8May 13, 2026 11:588,07774,985,14266,004,0001,036,0002,113,536
9May 13, 2026 11:588,13674,989,85366,505,0001,024,0002,113,536