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:50Kevin HeaveyKevin HeaveyScore: 3,560Success
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:513,50937,533,59728,090,0001,037,0002,113,536
2Sep 6, 2026 10:513,51637,786,32527,949,0001,242,0002,113,536
3Sep 6, 2026 10:513,54237,843,54428,309,0001,097,0002,113,536
4Sep 6, 2026 10:513,55038,023,18928,403,0001,069,0002,113,536
5Sep 6, 2026 10:513,56038,114,54628,506,0001,044,0002,113,536
6Sep 6, 2026 10:513,56438,167,72228,403,0001,179,0002,113,536
7Sep 6, 2026 10:513,61338,567,16428,938,0001,051,0002,113,536
8Sep 6, 2026 10:513,62339,900,88029,013,0001,066,0002,113,536
9Sep 6, 2026 10:513,80640,227,31930,364,0001,227,0002,113,536