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 listOct 7, 2024 20:55Rafał WięcekRafał WięcekScore: 368,194Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 7, 2024 20:55365,0943,056,768,2832,964,322,00065,962,0002,363,392
2Oct 7, 2024 20:55366,0833,070,430,3042,971,521,00066,966,0002,285,568
3Oct 7, 2024 20:55367,7883,082,256,7902,987,667,00064,971,0002,285,568
4Oct 7, 2024 20:55368,0293,081,748,5793,003,660,00050,977,0002,359,296
5Oct 7, 2024 20:55368,1943,088,588,7283,007,029,00048,984,0002,293,760
6Oct 7, 2024 20:55368,9033,085,504,8303,000,921,00060,978,0002,293,760
7Oct 7, 2024 20:55370,0523,094,854,0822,998,472,00072,962,0002,293,760
8Oct 7, 2024 20:55370,3033,102,917,7932,996,556,00076,962,0002,293,760
9Oct 7, 2024 20:55398,4533,336,067,1373,248,192,00058,967,0002,363,392