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 14:15gchebanovgchebanovScore: 28,507Success
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 14:1528,444261,780,361234,088,0002,000,0002,383,872
2Jun 28, 2021 14:1528,464267,436,009235,250,0001,001,0002,392,064
3Jun 28, 2021 14:1528,466256,912,715236,269,00002,260,992
4Jun 28, 2021 14:1528,492259,015,340236,485,00002,260,992
5Jun 28, 2021 14:1528,497269,550,647236,524,00002,387,968
6Jun 28, 2021 14:1528,498265,656,090236,536,00002,387,968
7Jun 28, 2021 14:1528,507261,074,799235,602,0001,002,0002,379,776
8Jun 28, 2021 14:1528,521267,781,778235,723,000998,0002,523,136
9Jun 28, 2021 14:1528,561264,129,085235,053,0002,000,0002,387,968
10Jun 28, 2021 14:1529,042308,654,170241,046,45102,252,800
11Jun 28, 2021 14:1529,077295,640,238241,340,98002,265,088
12Jun 28, 2021 14:1529,394311,426,464243,966,90202,252,800