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:16Yuriy LyfenkoYuriy LyfenkoScore: 13,303Success
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:1613,276384,984,691110,187,00002,260,992
2Jun 28, 2021 18:1613,285382,211,664109,267,0001,002,0002,260,992
3Jun 28, 2021 18:1613,287389,683,271109,281,0001,002,0002,260,992
4Jun 28, 2021 18:1613,293382,477,080110,334,00002,396,160
5Jun 28, 2021 18:1613,301380,349,151110,398,00002,260,992
6Jun 28, 2021 18:1613,302391,119,149109,406,0001,003,0002,523,136
7Jun 28, 2021 18:1613,303393,938,196110,412,00002,510,848
8Jun 28, 2021 18:1613,316393,661,662108,535,0001,991,0002,260,992
9Jun 28, 2021 18:1613,321389,205,724109,566,000996,0002,396,160
10Jun 28, 2021 18:1613,577433,364,552112,688,11502,240,512
11Jun 28, 2021 18:1613,585436,344,786112,759,14302,269,184
12Jun 28, 2021 18:1613,585417,235,025112,755,55302,273,280