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:15Yuriy LyfenkoYuriy LyfenkoScore: 13,305Success
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:1513,289396,690,216109,294,0001,002,0002,387,968
2Jun 28, 2021 18:1513,290395,732,305109,306,0001,002,0002,400,256
3Jun 28, 2021 18:1513,290388,955,916109,309,0001,002,0002,260,992
4Jun 28, 2021 18:1513,292390,071,196109,325,0001,002,0002,392,064
5Jun 28, 2021 18:1513,295383,346,622110,349,00002,260,992
6Jun 28, 2021 18:1513,301382,262,760110,397,00002,260,992
7Jun 28, 2021 18:1513,305386,636,284110,434,00002,260,992
8Jun 28, 2021 18:1513,311390,724,463109,486,000995,0002,523,136
9Jun 28, 2021 18:1513,316387,180,459109,531,000995,0002,260,992
10Jun 28, 2021 18:1513,572420,789,444112,650,87602,273,280
11Jun 28, 2021 18:1513,578415,601,708112,694,40402,269,184
12Jun 28, 2021 18:1513,580429,886,426112,711,00002,269,184