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 listDec 14, 2024 15:19MatthiasMatthiasScore: 8,603Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 14, 2024 15:208,59492,965,74370,329,0001,004,0002,273,280
2Dec 14, 2024 15:198,59692,736,43670,341,0001,004,0002,285,568
3Dec 14, 2024 15:208,59794,756,05070,350,0001,005,0002,273,280
4Dec 14, 2024 15:198,59897,348,11270,357,0001,005,0002,285,568
5Dec 14, 2024 15:198,60297,629,80470,393,0001,005,0002,523,136
6Dec 14, 2024 15:208,60292,721,58270,388,0001,005,0002,265,088
7Dec 14, 2024 15:198,60392,694,62070,404,0001,005,0002,285,568
8Dec 14, 2024 15:208,60897,312,68171,444,00002,265,088
9Dec 14, 2024 15:208,61295,662,70070,477,0001,006,0002,285,568
10Dec 14, 2024 15:208,61499,446,42670,492,0001,007,0002,265,088
11Dec 14, 2024 15:198,656103,494,31571,847,00002,285,568
12Dec 14, 2024 15:198,80598,474,11271,080,0002,002,0002,273,280