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 24, 2024 08:58Sean DewarSean DewarScore: 1,825,962Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 24, 2024 08:581,825,54115,183,637,95715,088,021,00063,970,0002,273,280
2Dec 24, 2024 08:581,825,69815,189,466,58115,091,323,00061,972,0002,277,376
3Dec 24, 2024 08:581,825,74015,185,195,72215,084,673,00068,971,0002,277,376
4Dec 24, 2024 08:581,825,85415,189,135,82215,072,623,00081,965,0002,277,376
5Dec 24, 2024 08:581,825,96215,185,534,87515,086,512,00068,970,0002,363,392
6Dec 24, 2024 08:581,826,22815,192,113,79815,097,720,00059,971,0002,277,376
7Dec 24, 2024 08:581,826,46515,188,615,21115,081,693,00077,967,0002,285,568
8Dec 24, 2024 08:581,826,55415,188,523,94615,083,429,00076,966,0002,289,664
9Dec 24, 2024 08:581,827,70615,202,452,57415,100,989,00068,972,0002,289,664