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, 2024 17:08Drew GarciaDrew GarciaScore: 58,902Success
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, 2024 17:0858,896517,725,379486,835,0001,999,0002,396,160
2Sep 27, 2024 17:0858,898514,369,946485,858,0002,999,0002,273,280
3Sep 27, 2024 17:0858,899514,336,267486,865,0001,999,0002,269,184
4Sep 27, 2024 17:0858,900513,025,832487,875,000999,0002,269,184
5Sep 27, 2024 17:0858,902512,315,321486,888,0001,999,0002,396,160
6Sep 27, 2024 17:0858,910512,750,850487,958,000999,0002,396,160
7Sep 27, 2024 17:0858,912511,699,481487,974,000999,0002,404,352
8Sep 27, 2024 17:0858,919518,367,226488,027,0001,000,0002,269,184
9Sep 27, 2024 17:0858,926510,500,629488,089,0001,000,0002,400,256