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 listAug 16, 2026 18:41marko1597marko1597Score: 4,873Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 18:424,86648,751,05639,239,0001,153,0002,113,536
2Aug 16, 2026 18:424,87048,851,25439,259,0001,162,0002,113,536
3Aug 16, 2026 18:424,87048,864,61239,260,0001,161,0002,113,536
4Aug 16, 2026 18:424,87148,833,81439,281,0001,154,0002,113,536
5Aug 16, 2026 18:424,87348,765,24339,286,0001,160,0002,113,536
6Aug 16, 2026 18:424,88548,899,53839,394,0001,158,0002,113,536
7Aug 16, 2026 18:424,88750,168,41539,411,0001,152,0002,113,536
8Aug 16, 2026 18:424,88948,936,16139,423,0001,156,0002,113,536
9Aug 16, 2026 18:424,89649,059,87339,525,0001,116,0002,113,536