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 14:05matsuoka-601matsuoka-601Score: 6,871Success
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 14:056,80082,707,41655,434,0001,007,0002,404,352
2Dec 15, 2023 14:056,81880,847,32655,577,0001,010,0002,523,136
3Dec 15, 2023 14:056,84580,910,69454,823,0001,993,0002,523,136
4Dec 15, 2023 14:056,84880,636,35054,848,0001,994,0002,400,256
5Dec 15, 2023 14:056,85479,019,16154,895,0001,996,0002,404,352
6Dec 15, 2023 14:056,86778,771,74954,993,0001,999,0002,404,352
7Dec 15, 2023 14:056,87187,246,34756,028,0001,000,0002,408,448
8Dec 15, 2023 14:056,93083,226,82155,500,0002,018,0002,523,136
9Dec 15, 2023 14:056,93492,650,31856,542,0001,009,0002,400,256
10Dec 15, 2023 14:056,997122,929,44658,072,66902,285,568
11Dec 15, 2023 14:057,020120,622,91658,262,83202,277,376
12Dec 15, 2023 14:057,236118,742,27260,057,48102,281,472