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 listNov 19, 2022 04:24ig0rskyig0rskyScore: 374,587Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 19, 2022 04:24374,1193,164,975,0953,105,187,82002,232,320
2Nov 19, 2022 04:24374,5873,166,342,4793,109,072,77702,310,144
3Nov 19, 2022 04:24375,6393,177,785,5313,117,806,78302,277,376