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 20, 2026 11:12Victor MerckléVictor MerckléScore: 5,673Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 11:135,63954,795,67545,776,0001,031,0002,113,536
2May 20, 2026 11:135,64756,258,46645,853,0001,021,0002,113,536
3May 20, 2026 11:135,66355,504,73645,988,0001,020,0002,113,536
4May 20, 2026 11:135,66454,901,98846,019,0001,000,0002,113,536
5May 20, 2026 11:135,67354,928,35146,076,0001,016,0002,113,536
6May 20, 2026 11:135,67957,852,89346,111,0001,025,0002,113,536
7May 20, 2026 11:135,71258,278,72946,375,0001,041,0002,113,536
8May 20, 2026 11:135,81956,197,63147,267,0001,037,0002,113,536
9May 20, 2026 11:135,84057,373,16447,468,0001,006,0002,113,536