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 listJun 28, 2021 19:03Yuriy LyfenkoYuriy LyfenkoScore: 12,707Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2021 19:0312,678378,660,435104,226,0001,002,0002,260,992
2Jun 28, 2021 19:0312,682380,474,504104,262,0001,002,0002,265,088
3Jun 28, 2021 19:0312,695376,595,304104,368,0001,003,0002,387,968
4Jun 28, 2021 19:0312,697382,176,351105,389,00002,523,136
5Jun 28, 2021 19:0312,704386,987,858105,447,00002,392,064
6Jun 28, 2021 19:0312,704382,303,632105,447,00002,523,136
7Jun 28, 2021 19:0312,707389,036,321104,464,0001,004,0002,260,992
8Jun 28, 2021 19:0312,707383,230,070105,471,00002,260,992
9Jun 28, 2021 19:0312,714386,037,243104,523,0001,005,0002,523,136
10Jun 28, 2021 19:0313,759428,138,756114,198,12602,232,320
11Jun 28, 2021 19:0313,765425,223,478114,245,67702,256,896
12Jun 28, 2021 19:0313,779425,250,314114,367,80202,256,896