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:35gchebanovgchebanovScore: 30,573Success
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:3528,654266,076,584235,833,0001,998,0002,400,256
2Jun 28, 2021 14:3530,044307,973,829249,366,98402,289,664
3Jun 28, 2021 14:3530,056306,518,688249,465,89302,281,472
4Jun 28, 2021 14:3530,064305,862,576249,527,46102,269,184
5Jun 28, 2021 14:3530,345273,692,917249,867,0001,998,0002,273,280
6Jun 28, 2021 14:3530,536278,877,370252,450,0001,001,0002,273,280
7Jun 28, 2021 14:3530,573279,681,374251,760,0001,998,0002,273,280
8Jun 28, 2021 14:3530,575281,783,008252,770,000999,0002,273,280
9Jun 28, 2021 14:3530,576285,014,213251,783,0001,998,0002,400,256
10Jun 28, 2021 14:3530,590279,717,077251,901,0001,999,0002,273,280
11Jun 28, 2021 14:3530,604283,829,005252,011,0002,000,0002,273,280
12Jun 28, 2021 14:3530,654276,943,187254,427,00002,404,352