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 30, 2021 21:57Yuriy LyfenkoYuriy LyfenkoScore: 13,966Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2021 21:5713,771426,284,477114,299,19302,265,088
2Jun 30, 2021 21:5713,771424,878,789114,301,79702,240,512
3Jun 30, 2021 21:5713,791419,909,390114,461,22702,240,512
4Jun 30, 2021 21:5713,961393,330,512114,878,000998,0002,260,992
5Jun 30, 2021 21:5713,963392,672,572113,891,0001,998,0002,260,992
6Jun 30, 2021 21:5713,963394,061,099113,896,0001,998,0002,396,160
7Jun 30, 2021 21:5713,966392,289,489113,919,0001,998,0002,260,992
8Jun 30, 2021 21:5713,968393,784,745113,936,0001,998,0002,523,136
9Jun 30, 2021 21:5713,969398,976,472113,944,0001,999,0002,260,992
10Jun 30, 2021 21:5713,970395,911,339114,949,000999,0002,396,160
11Jun 30, 2021 21:5713,970390,077,324114,956,000999,0002,260,992
12Jun 30, 2021 21:5713,971398,314,962113,962,0001,999,0002,260,992