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 listMay 6, 2024 09:57Andrei LuzanAndrei LuzanScore: 1,646,707Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 6, 2024 09:561,644,17813,718,008,99813,646,678,76202,256,896
2May 6, 2024 09:561,645,61513,743,001,42813,658,604,87402,265,088
3May 6, 2024 09:561,646,05413,724,789,67913,662,244,22002,265,088
4May 6, 2024 09:571,646,70713,734,411,02813,667,665,22802,256,896
5May 6, 2024 09:571,653,15413,792,281,62713,721,175,97102,256,896
6May 6, 2024 09:571,735,96014,498,780,93714,408,468,20702,265,088