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 listSep 27, 2022 09:13PhibPhibScore: 212,139Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 27, 2022 09:13212,0981,812,831,6361,760,417,10302,265,088
2Sep 27, 2022 09:13212,1391,816,128,3941,760,753,85402,269,184
3Sep 27, 2022 09:13212,1991,816,969,2941,761,255,64302,265,088