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 5, 2023 19:08Radek SzymanskiRadek SzymanskiScore: 45,117Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2023 18:5745,082444,525,264374,176,64502,273,280
2Jul 5, 2023 19:0845,087424,114,948374,220,12502,269,184
3Jul 5, 2023 18:5745,094451,625,575374,284,07602,277,376
4Jul 5, 2023 19:0845,117433,832,106374,471,47502,273,280
5Jul 5, 2023 18:5745,121438,546,385374,506,21002,273,280
6Jul 5, 2023 19:0845,127442,395,347374,556,78002,265,088