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 14:38gchebanovgchebanovScore: 28,183Success
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 14:3827,814256,492,343228,860,0001,998,0002,400,256
2Jun 28, 2021 14:3827,818253,565,951229,891,000999,0002,273,280
3Jun 28, 2021 14:3827,837249,943,943230,043,0001,000,0002,519,040
4Jun 28, 2021 14:3827,879252,191,885230,396,0001,001,0002,400,256
5Jun 28, 2021 14:3828,151261,269,453232,659,000998,0002,273,280
6Jun 28, 2021 14:3828,178258,852,159231,881,0001,998,0002,273,280
7Jun 28, 2021 14:3828,183255,653,611232,916,000999,0002,404,352
8Jun 28, 2021 14:3828,200264,699,964233,057,0001,000,0002,408,448
9Jun 28, 2021 14:3828,398263,487,082235,705,00002,400,256
10Jun 28, 2021 14:3829,819315,104,889247,495,28102,289,664
11Jun 28, 2021 14:3829,990300,439,536248,918,97402,269,184
12Jun 28, 2021 14:3830,028300,910,462249,231,18602,277,376