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 15, 2023 13:20matsuoka-601matsuoka-601Score: 7,192Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 15, 2023 13:207,06784,984,58758,659,00002,523,136
2Dec 15, 2023 13:207,10081,484,00957,930,000998,0002,408,448
3Dec 15, 2023 13:207,11082,734,29757,010,0002,000,0002,404,352
4Dec 15, 2023 13:207,15381,565,24958,361,0001,006,0002,412,544
5Dec 15, 2023 13:207,17081,869,67158,499,0001,008,0002,396,160
6Dec 15, 2023 13:207,175125,167,58059,556,07602,273,280
7Dec 15, 2023 13:207,192121,922,71759,695,46002,281,472
8Dec 15, 2023 13:207,22285,144,58757,943,0001,998,0002,523,136
9Dec 15, 2023 13:207,24784,652,68758,149,0002,005,0002,408,448
10Dec 15, 2023 13:207,27681,018,92560,387,00002,400,256
11Dec 15, 2023 13:207,278130,991,11760,410,25402,277,376
12Dec 15, 2023 13:207,28084,489,39859,413,0001,007,0002,400,256