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 20, 2022 09:21y-iy-iScore: 488,822Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2022 09:21487,7024,116,814,5264,047,922,93202,240,512
2May 20, 2022 09:16488,0974,108,785,2524,051,201,15602,236,416
3May 20, 2022 09:16488,7224,118,143,7154,056,391,99802,244,608
4May 20, 2022 09:21488,8224,123,840,3954,057,226,06302,236,416
5May 20, 2022 09:21489,0124,113,311,7714,058,798,52902,236,416
6May 20, 2022 09:16489,4684,100,443,7714,062,585,19402,240,512