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 listJan 1, 2023 13:54Vytautas GruslysVytautas GruslysScore: 24,093Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2023 13:5423,590221,305,950193,799,0001,997,0002,285,568
2Jan 1, 2023 13:5423,829223,620,231195,781,0001,997,0002,285,568
3Jan 1, 2023 13:5423,858224,270,149197,021,0001,000,0002,285,568
4Jan 1, 2023 13:5424,000223,175,704197,195,0002,001,0002,269,184
5Jan 1, 2023 13:5424,001222,026,838197,210,0002,002,0002,285,568
6Jan 1, 2023 13:5424,058226,605,756197,683,0001,996,0002,285,568
7Jan 1, 2023 13:5424,093225,377,540198,975,000999,0002,523,136
8Jan 1, 2023 13:5424,093220,289,297197,977,0001,999,0002,523,136
9Jan 1, 2023 13:5424,142267,037,589200,378,41402,277,376
10Jan 1, 2023 13:5424,223221,807,521200,047,0001,000,0002,273,280
11Jan 1, 2023 13:5424,324257,056,615201,889,34802,289,664
12Jan 1, 2023 13:5425,444268,816,579211,188,13902,285,568