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 listOct 16, 2026 18:54KacpxerKacpxerScore: 6,015Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2026 18:545,74558,218,17646,410,0001,281,0002,113,536
2Oct 16, 2026 18:545,75058,212,77146,465,0001,266,0002,113,536
3Oct 16, 2026 18:545,79258,589,08647,066,0001,012,0002,113,536
4Oct 16, 2026 18:545,81758,789,26747,085,0001,203,0002,113,536
5Oct 16, 2026 18:546,01560,388,39748,725,0001,206,0002,113,536
6Oct 16, 2026 18:547,02368,801,44657,090,0001,206,0002,113,536
7Oct 16, 2026 18:547,10169,434,90757,859,0001,080,0002,113,536
8Oct 16, 2026 18:547,25472,008,06359,201,0001,011,0002,113,536
9Oct 16, 2026 18:547,94476,492,33664,735,0001,205,0002,113,536