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 00:13Yuriy LyfenkoYuriy LyfenkoScore: 47,091Success
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 00:1347,086457,966,859390,811,27102,207,744
2Jan 17, 2022 00:1347,091453,754,171390,852,96002,220,032
3Jan 17, 2022 00:1347,091454,394,059390,855,02802,215,936