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:06Dominique GarmierDominique GarmierScore: 7,310Success
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:077,21177,812,87756,865,0002,992,0002,330,624
2Apr 24, 2026 08:077,25979,469,78857,238,0003,012,0002,342,912
3Apr 24, 2026 08:077,26578,388,41157,286,0003,015,0002,445,312
4Apr 24, 2026 08:077,29877,451,41758,560,0002,019,0002,441,216
5Apr 24, 2026 08:077,31082,399,29257,690,0002,984,0002,437,120
6Apr 24, 2026 08:077,32577,254,45057,811,0002,990,0002,437,120
7Apr 24, 2026 08:077,34280,542,69557,945,0002,997,0002,445,312
8Apr 24, 2026 08:077,36778,320,80658,147,0003,007,0002,342,912
9Apr 24, 2026 08:077,39381,621,34159,358,0002,012,0002,445,312