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 listJul 4, 2023 14:23bekornbekornScore: 59,926Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2023 14:2359,911566,910,643497,259,76602,273,280
2Jul 4, 2023 14:2159,918557,988,047497,318,21902,277,376
3Jul 4, 2023 14:2159,923547,734,547497,361,96002,269,184
4Jul 4, 2023 14:2359,926553,589,672497,387,96602,273,280
5Jul 4, 2023 14:2159,927555,975,092497,397,36902,240,512
6Jul 4, 2023 14:2359,936542,789,936497,464,93102,269,184