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 25, 2024 13:35Aniruddha DebAniruddha DebScore: 1,825,155Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 25, 2024 13:351,820,26215,132,349,93015,044,206,00063,971,0002,277,376
2Dec 25, 2024 13:351,820,67615,139,265,63115,034,644,00076,967,0002,289,664
3Dec 25, 2024 13:351,821,56115,144,902,19815,054,989,00063,970,0002,277,376
4Dec 25, 2024 13:351,822,26815,153,133,64815,053,856,00070,971,0002,273,280
5Dec 25, 2024 13:351,825,15515,184,280,24515,074,826,00073,964,0002,273,280
6Dec 25, 2024 13:351,826,16015,188,912,77815,103,150,00053,975,0002,285,568
7Dec 25, 2024 13:351,828,60515,208,001,22315,100,457,00076,966,0002,277,376
8Dec 25, 2024 13:351,828,70915,213,691,20315,104,321,00073,967,0002,277,376
9Dec 25, 2024 13:351,828,71315,207,489,30915,105,348,00072,967,0002,277,376