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 listApr 29, 2026 11:22Dominique GarmierDominique GarmierScore: 6,872Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 11:236,79877,209,56454,412,0002,015,0002,347,008
2Apr 29, 2026 11:236,81771,455,31054,564,0002,020,0002,351,104
3Apr 29, 2026 11:236,84174,693,74553,795,0002,988,0002,342,912
4Apr 29, 2026 11:236,84678,044,78153,833,0002,990,0002,355,200
5Apr 29, 2026 11:236,87276,324,73754,036,0003,002,0002,342,912
6Apr 29, 2026 11:236,90776,281,22555,323,0002,011,0002,334,720
7Apr 29, 2026 11:236,91775,976,35155,401,0002,014,0002,355,200
8Apr 29, 2026 11:236,92674,973,50355,476,0002,017,0002,347,008
9Apr 29, 2026 11:236,99076,431,97456,020,0002,000,0002,351,104