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 listAug 31, 2023 04:56matsuoka-601matsuoka-601Score: 7,435Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2023 04:587,379121,373,75261,248,82902,289,664
2Aug 31, 2023 04:577,388123,961,16961,319,69902,179,072
3Aug 31, 2023 04:587,393134,951,31861,362,28402,297,856
4Aug 31, 2023 04:577,400123,374,28561,417,23002,289,664
5Aug 31, 2023 04:567,435134,888,54561,706,84202,285,568
6Aug 31, 2023 04:587,452124,650,01061,854,90202,289,664
7Aug 31, 2023 04:577,472137,555,38462,020,61402,293,760
8Aug 31, 2023 04:567,486119,634,27662,133,43202,297,856
9Aug 31, 2023 04:567,760133,180,72264,409,35302,297,856