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 listNov 11, 2024 09:31ZOTTIGZOTTIGScore: 504,064Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2024 09:31500,3154,187,499,4274,061,687,00090,925,0002,535,424
2Nov 11, 2024 09:31500,5844,183,923,7534,091,865,00062,982,0002,285,568
3Nov 11, 2024 09:31502,9094,204,691,7444,098,181,00075,966,0002,375,680
4Nov 11, 2024 09:31503,8944,212,992,4524,111,363,00070,954,0002,334,720
5Nov 11, 2024 09:31504,0644,214,264,1904,109,769,00073,959,0002,478,080
6Nov 11, 2024 09:31504,1684,217,557,7084,113,615,00070,976,0002,535,424
7Nov 11, 2024 09:31505,1124,229,194,2754,134,476,00057,950,0002,318,336
8Nov 11, 2024 09:31505,2304,224,805,9924,120,440,00072,972,0002,514,944
9Nov 11, 2024 09:31508,8104,256,127,4444,152,170,00070,951,0002,465,792