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 listDec 15, 2023 13:57matsuoka-601matsuoka-601Score: 7,202Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 15, 2023 13:577,091124,481,92658,851,77302,277,376
2Dec 15, 2023 13:587,134139,282,53859,208,26602,277,376
3Dec 15, 2023 13:577,144122,676,61559,292,82402,273,280
4Dec 15, 2023 13:577,171117,920,31859,519,49902,273,280
5Dec 15, 2023 13:577,202123,692,46759,778,40502,285,568
6Dec 15, 2023 13:587,208127,084,76059,826,92502,273,280
7Dec 15, 2023 13:587,231122,589,69160,020,19902,289,664
8Dec 15, 2023 13:577,350130,203,76561,003,69102,236,416
9Dec 15, 2023 13:577,390123,199,35461,335,41302,277,376