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 24, 2026 08:13Dominique GarmierDominique GarmierScore: 6,840Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 08:146,76971,933,70753,180,0003,010,0002,347,008
2Apr 24, 2026 08:146,76975,303,36053,176,0003,009,0002,342,912
3Apr 24, 2026 08:146,77071,971,71953,189,0003,010,0002,342,912
4Apr 24, 2026 08:146,79973,344,46054,419,0002,015,0002,437,120
5Apr 24, 2026 08:146,84074,060,25353,791,0002,988,0002,334,720
6Apr 24, 2026 08:146,87373,012,23354,047,0003,002,0002,351,104
7Apr 24, 2026 08:146,90073,255,58754,256,0003,014,0002,441,216
8Apr 24, 2026 08:146,90270,534,65155,279,0002,010,0002,342,912
9Apr 24, 2026 08:146,96679,083,66054,833,0002,990,0002,330,624