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 listJul 5, 2021 16:12Yuriy LyfenkoYuriy LyfenkoScore: 35,639Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2021 16:1235,613353,391,606295,588,41602,224,128
2Jul 5, 2021 16:1235,633363,519,622295,757,06102,211,840
3Jul 5, 2021 16:1235,635357,211,818295,772,23402,224,128
4Jul 5, 2021 16:1235,639370,311,203295,806,12202,220,032
5Jul 5, 2021 16:1235,640366,244,581295,808,68002,220,032
6Jul 5, 2021 16:1235,649358,217,471295,890,75102,215,936