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 listJan 17, 2022 06:42Yuriy LyfenkoYuriy LyfenkoScore: 27,294Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 17, 2022 06:4227,274253,335,885225,370,0001,001,0002,523,136
2Jan 17, 2022 06:4227,280248,558,689225,421,0001,001,0002,326,528
3Jan 17, 2022 06:4227,291254,347,236225,514,0001,002,0002,326,528
4Jan 17, 2022 06:4227,292253,085,107225,519,0001,002,0002,326,528
5Jan 17, 2022 06:4227,293282,732,419226,530,69202,215,936
6Jan 17, 2022 06:4227,293256,029,174224,526,0002,004,0002,326,528
7Jan 17, 2022 06:4227,294279,485,159226,537,61502,224,128
8Jan 17, 2022 06:4227,296251,636,272225,556,0001,002,0002,527,232
9Jan 17, 2022 06:4227,302254,068,684225,601,0001,002,0002,326,528
10Jan 17, 2022 06:4227,315253,075,250224,720,0001,997,0002,527,232
11Jan 17, 2022 06:4227,315256,925,392224,721,0001,997,0002,326,528
12Jan 17, 2022 06:4227,316305,357,300226,725,02602,215,936