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 listOct 11, 2024 01:33Joad NacerJoad NacerScore: 4,600Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2024 01:334,50858,155,42134,383,0003,033,0002,506,752
2Oct 11, 2024 01:334,51760,089,67936,477,0001,013,0002,519,040
3Oct 11, 2024 01:334,56061,609,33035,853,0001,991,0002,334,720
4Oct 11, 2024 01:334,60058,966,05237,180,0001,004,0002,330,624
5Oct 11, 2024 01:334,61063,687,91537,253,0001,006,0002,342,912
6Oct 11, 2024 01:334,61457,986,10535,271,0003,023,0002,502,656