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 16:57Yuriy LyfenkoYuriy LyfenkoScore: 13,462Success
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 16:5713,452386,023,769111,652,00002,523,136
2Jun 28, 2021 16:5713,453385,057,364110,663,000996,0002,523,136
3Jun 28, 2021 16:5713,454387,220,019110,669,000997,0002,260,992
4Jun 28, 2021 16:5713,459387,679,642109,718,0001,994,0002,523,136
5Jun 28, 2021 16:5713,460388,694,684110,721,000997,0002,392,064
6Jun 28, 2021 16:5713,461387,516,126111,730,00002,265,088
7Jun 28, 2021 16:5713,462394,155,146109,742,0001,995,0002,383,872
8Jun 28, 2021 16:5713,469391,603,647109,799,0001,996,0002,392,064
9Jun 28, 2021 16:5713,586387,232,536111,770,000997,0002,514,944
10Jun 28, 2021 16:5713,647434,755,921113,268,62702,236,416
11Jun 28, 2021 16:5713,648423,344,438113,274,41502,265,088
12Jun 28, 2021 16:5713,649429,159,065113,288,75402,260,992