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 listDec 15, 2023 11:51Dmitrii VasilevDmitrii VasilevScore: 76,455Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 15, 2023 11:5176,216694,771,002632,590,97002,260,992
2Dec 15, 2023 12:0076,245700,016,517632,833,86702,260,992
3Dec 15, 2023 12:0076,292699,470,436633,220,06502,252,800
4Dec 15, 2023 11:5176,455699,012,310634,573,13002,260,992
5Dec 15, 2023 11:5176,480715,424,125634,786,47902,252,800
6Dec 15, 2023 12:0076,485716,340,559634,822,03802,256,896