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 12, 2026 16:07Kevin HeaveyKevin HeaveyScore: 3,790Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2026 16:083,56738,442,63128,572,0001,036,0002,113,536
2Sep 12, 2026 16:083,62838,868,44928,964,0001,154,0002,113,536
3Sep 12, 2026 16:083,76240,083,42730,182,0001,045,0002,113,536
4Sep 12, 2026 16:083,77540,074,98830,109,0001,227,0002,113,536
5Sep 12, 2026 16:083,79040,361,20630,383,0001,082,0002,113,536
6Sep 12, 2026 16:083,82140,360,82030,682,0001,040,0002,113,536
7Sep 12, 2026 16:083,85040,820,53430,931,0001,032,0002,113,536
8Sep 12, 2026 16:083,85940,919,37830,968,0001,064,0002,113,536
9Sep 12, 2026 16:083,87741,053,34031,145,0001,040,0002,113,536