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 6, 2026 10:06Kevin HeaveyKevin HeaveyScore: 3,757Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 10:083,54339,485,53428,250,0001,165,0002,113,536
2Sep 6, 2026 10:083,56739,576,59428,397,0001,216,0002,117,632
3Sep 6, 2026 10:083,57439,753,30828,514,0001,157,0002,113,536
4Sep 6, 2026 10:083,73841,119,76329,989,0001,044,0002,113,536
5Sep 6, 2026 10:083,75741,151,92230,031,0001,160,0002,113,536
6Sep 6, 2026 10:083,81041,702,60930,461,0001,167,0002,113,536
7Sep 6, 2026 10:083,82241,682,68130,577,0001,151,0002,113,536
8Sep 6, 2026 10:083,85842,073,57730,858,0001,164,0002,113,536
9Sep 6, 2026 10:083,86342,187,96230,872,0001,194,0002,113,536