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 listOct 19, 2022 16:34Kyle SoskinKyle SoskinScore: 187,206Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2022 16:34187,0221,615,392,9751,552,285,02202,203,648
2Oct 19, 2022 16:34187,2061,608,562,3371,553,807,75302,203,648
3Oct 19, 2022 16:34187,2151,613,550,8151,553,880,85302,199,552