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 12, 2023 14:47mr.Themr.TheScore: 242,995Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 12, 2023 14:56242,7962,079,997,6782,015,204,02502,228,224
2Dec 12, 2023 14:56242,8242,096,202,9822,015,439,31402,240,512
3Dec 12, 2023 14:47242,8482,081,061,1892,015,641,44402,236,416
4Dec 12, 2023 14:47242,9952,085,472,8092,016,856,32602,228,224
5Dec 12, 2023 14:56243,0422,073,799,0632,017,250,92002,240,512
6Dec 12, 2023 14:47243,0612,071,957,4482,017,405,22902,232,320