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 12:03Victor MerckléVictor MerckléScore: 8,335Success
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 12:038,32778,470,57168,082,0001,036,0002,113,536
2May 13, 2026 12:038,32878,603,13568,121,0001,003,0002,113,536
3May 13, 2026 12:038,33076,837,70168,120,0001,025,0002,113,536
4May 13, 2026 12:038,33278,316,45069,162,00002,113,536
5May 13, 2026 12:038,33576,467,60568,142,0001,039,0002,113,536
6May 13, 2026 12:038,33578,794,98568,176,0001,012,0002,113,536
7May 13, 2026 12:038,34077,758,09368,192,0001,031,0002,113,536
8May 13, 2026 12:038,34076,498,95068,181,0001,045,0002,113,536
9May 13, 2026 12:038,34079,352,13668,177,0001,045,0002,113,536