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:20Victor MerckléVictor MerckléScore: 5,583Success
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:215,57257,107,88045,192,0001,059,0002,113,536
2May 20, 2026 11:215,57454,481,40145,202,0001,067,0002,113,536
3May 20, 2026 11:215,57755,081,07745,229,0001,068,0002,113,536
4May 20, 2026 11:215,58255,128,30645,287,0001,045,0002,113,536
5May 20, 2026 11:215,58356,277,81445,277,0001,066,0002,113,536
6May 20, 2026 11:215,58455,804,93145,298,0001,054,0002,113,536
7May 20, 2026 11:215,59455,583,40045,412,0001,019,0002,113,536
8May 20, 2026 11:215,60454,313,91645,453,0001,062,0002,113,536
9May 20, 2026 11:215,61355,422,92945,486,0001,110,0002,113,536