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 22, 2023 16:51Unays Unays Score: 454,055Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2023 16:51453,8873,836,267,1463,767,259,70502,232,320
2Feb 22, 2023 16:51454,0553,830,475,5083,768,657,38102,248,704
3Feb 22, 2023 16:51461,7983,897,113,8983,832,927,52302,248,704