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 listFeb 11, 2025 23:26Miguel Rodrigues Carrilho BorgesMiguel Rodrigues Carrilho BorgesScore: 1,829,713Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2025 23:261,825,53615,183,360,66315,089,975,00061,975,0002,289,664
2Feb 11, 2025 23:261,826,40315,194,118,94715,086,179,00072,967,0002,277,376
3Feb 11, 2025 23:261,826,46015,188,547,05015,094,647,00064,968,0002,400,256
4Feb 11, 2025 23:261,828,51515,204,287,03015,098,706,00077,967,0002,289,664
5Feb 11, 2025 23:261,829,71315,216,346,54115,110,654,00075,968,0002,277,376
6Feb 11, 2025 23:261,830,64815,223,936,36415,120,415,00073,967,0002,363,392
7Feb 11, 2025 23:261,832,10315,241,466,80415,152,480,00053,976,0002,289,664
8Feb 11, 2025 23:261,845,09915,347,568,74215,241,359,00072,963,0002,289,664
9Feb 11, 2025 23:261,918,83215,956,918,07215,862,331,00063,973,0002,277,376