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 15, 2024 02:19zielajzielajScore: 3,699Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 15, 2024 02:193,66955,159,93830,450,00002,351,104
2Nov 15, 2024 02:193,67552,936,42930,499,00002,531,328
3Nov 15, 2024 02:193,68353,190,01729,549,0001,018,0002,527,232
4Nov 15, 2024 02:193,68856,989,41329,587,0001,020,0002,351,104
5Nov 15, 2024 02:193,69562,785,30730,671,00002,527,232
6Nov 15, 2024 02:193,69856,115,15029,673,0001,023,0002,347,008
7Nov 15, 2024 02:193,69960,726,35729,675,0001,023,0002,338,816
8Nov 15, 2024 02:193,71754,018,06428,858,0001,990,0002,334,720
9Nov 15, 2024 02:193,71758,274,52729,855,000995,0002,347,008
10Nov 15, 2024 02:193,75453,327,08329,151,0002,010,0002,531,328
11Nov 15, 2024 02:193,79750,970,97631,519,00002,367,488
12Nov 15, 2024 02:193,80556,349,21431,582,00002,277,376