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 listFeb 16, 2024 23:46ttttScore: 355,208Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2024 23:46355,0543,007,537,3682,946,949,33502,265,088
2Feb 16, 2024 23:46355,2083,012,043,2982,948,223,57502,252,800
3Feb 16, 2024 23:46355,2543,013,694,6372,948,608,69702,273,280