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 listSep 12, 2022 04:00Yuriy LyfenkoYuriy LyfenkoScore: 9,316Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2022 04:009,267146,675,05676,917,16602,199,552
2Sep 12, 2022 04:009,316137,235,03677,326,91402,211,840
3Sep 12, 2022 04:009,665140,562,79880,222,57102,285,568