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 17, 2022 06:50Yuriy LyfenkoYuriy LyfenkoScore: 27,146Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 17, 2022 06:5027,123249,352,469222,121,0003,001,0002,543,616
2Jan 17, 2022 06:5027,128246,881,709223,159,0002,001,0002,473,984
3Jan 17, 2022 06:5027,128246,316,967222,164,0003,002,0002,281,472
4Jan 17, 2022 06:5027,133250,404,338223,199,0002,001,0002,543,616
5Jan 17, 2022 06:5027,135245,205,673223,217,0002,001,0002,539,520
6Jan 17, 2022 06:5027,137258,365,917222,235,0003,003,0002,539,520
7Jan 17, 2022 06:5027,146248,219,408223,312,0002,002,0002,478,080
8Jan 17, 2022 06:5027,147290,862,969225,321,52802,187,264
9Jan 17, 2022 06:5027,151284,138,543225,356,71902,191,360
10Jan 17, 2022 06:5027,157244,898,478223,400,0002,003,0002,478,080
11Jan 17, 2022 06:5027,162251,805,142224,441,0001,001,0002,273,280
12Jan 17, 2022 06:5027,167285,111,375225,487,21402,179,072