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 22, 2021 15:41Yuriy LyfenkoYuriy LyfenkoScore: 17,264Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2021 15:4117,216167,925,741140,896,0001,998,0002,260,992
2May 22, 2021 15:4117,220174,462,642141,924,000999,0002,387,968
3May 22, 2021 15:4117,222173,068,765140,946,0001,999,0002,260,992
4May 22, 2021 15:4117,223169,627,666140,950,0001,999,0002,260,992
5May 22, 2021 15:4117,227171,051,788140,984,0001,999,0002,400,256
6May 22, 2021 15:4117,230170,377,271142,010,0001,000,0002,523,136
7May 22, 2021 15:4117,264163,352,874143,294,00002,392,064
8May 22, 2021 15:4117,655178,284,901144,543,0001,993,0002,506,752
9May 22, 2021 15:4117,812178,065,750145,845,0001,997,0002,260,992
10May 22, 2021 15:4117,876208,886,202148,368,52702,265,088
11May 22, 2021 15:4117,886217,325,772148,454,32402,269,184
12May 22, 2021 15:4117,940209,639,507148,899,72402,269,184