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 listMay 19, 2021 20:02Yuriy LyfenkoYuriy LyfenkoScore: 17,874Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2021 20:0217,8502,792,318,415146,170,0001,988,0002,400,256
2May 19, 2021 20:0217,854993,153,811146,201,0001,989,0002,519,040
3May 19, 2021 20:0217,8592,670,955,963146,224,0002,003,0002,265,088
4May 19, 2021 20:0217,8603,037,742,897147,233,0001,001,0002,523,136
5May 19, 2021 20:0217,862836,604,594145,271,0002,985,0002,265,088
6May 19, 2021 20:0217,8711,564,253,727147,330,0001,002,0002,523,136
7May 19, 2021 20:0217,874944,816,191146,363,0001,991,0002,260,992
8May 19, 2021 20:0217,8841,525,385,055147,432,0001,002,0002,519,040
9May 19, 2021 20:0217,8862,917,552,277147,459,000996,0002,523,136
10May 19, 2021 20:0218,4872,604,769,772153,443,03802,273,280
11May 19, 2021 20:0218,4992,525,004,088153,543,03102,273,280
12May 19, 2021 20:0218,5042,300,772,456153,579,38902,269,184