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 18:17Yuriy LyfenkoYuriy LyfenkoScore: 13,294Success
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 18:1713,262388,273,487109,076,0001,000,0002,260,992
2Jun 28, 2021 18:1713,282388,278,901110,242,00002,523,136
3Jun 28, 2021 18:1713,285382,252,388110,262,00002,260,992
4Jun 28, 2021 18:1713,287382,394,661109,278,0001,002,0002,387,968
5Jun 28, 2021 18:1713,289382,998,652110,297,00002,260,992
6Jun 28, 2021 18:1713,291382,102,400109,314,0001,002,0002,400,256
7Jun 28, 2021 18:1713,294383,105,134110,340,00002,260,992
8Jun 28, 2021 18:1713,311387,202,452109,480,0001,004,0002,260,992
9Jun 28, 2021 18:1713,319391,454,921108,557,0001,991,0002,392,064
10Jun 28, 2021 18:1713,575426,059,952112,673,11702,269,184
11Jun 28, 2021 18:1713,578423,876,289112,697,21802,265,088
12Jun 28, 2021 18:1713,596420,399,242112,845,86902,273,280