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:27Yuriy LyfenkoYuriy LyfenkoScore: 14,300Success
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:2714,274398,661,792118,478,00002,260,992
2Jun 30, 2021 21:2714,277392,450,716117,497,0001,004,0002,260,992
3Jun 30, 2021 21:2714,280395,044,111117,520,0001,004,0002,260,992
4Jun 30, 2021 21:2714,291392,066,124118,614,00002,260,992
5Jun 30, 2021 21:2714,297396,815,272116,670,0001,994,0002,260,992
6Jun 30, 2021 21:2714,298396,444,834117,673,000997,0002,260,992
7Jun 30, 2021 21:2714,300394,985,115117,697,000997,0002,523,136
8Jun 30, 2021 21:2714,303395,858,637116,723,0001,995,0002,260,992
9Jun 30, 2021 21:2714,307397,351,237117,755,000997,0002,260,992
10Jun 30, 2021 21:2714,484424,789,419120,217,41602,244,608
11Jun 30, 2021 21:2714,487430,432,486120,240,18202,244,608
12Jun 30, 2021 21:2714,488437,411,560120,246,66302,244,608