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 23:47Yuriy LyfenkoYuriy LyfenkoScore: 15,322Success
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 23:4714,826437,467,707123,059,27702,256,896
2Jun 30, 2021 23:4714,827434,763,769123,060,82902,236,416
3Jun 30, 2021 23:4714,829436,492,468123,082,27402,240,512
4Jun 30, 2021 23:4715,313401,023,523126,098,0001,000,0002,523,136
5Jun 30, 2021 23:4715,315400,687,544127,115,00002,523,136
6Jun 30, 2021 23:4715,319398,153,608126,149,0001,001,0002,396,160
7Jun 30, 2021 23:4715,322398,181,853126,173,0001,001,0002,396,160
8Jun 30, 2021 23:4715,323400,058,839127,182,00002,523,136
9Jun 30, 2021 23:4715,331399,567,943126,244,0001,001,0002,392,064
10Jun 30, 2021 23:4715,333402,687,049126,261,0001,002,0002,396,160
11Jun 30, 2021 23:4715,337400,830,887127,297,00002,523,136
12Jun 30, 2021 23:4715,338400,596,516126,300,0001,002,0002,396,160