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 10, 2022 05:46Yuriy LyfenkoYuriy LyfenkoScore: 12,721Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 10, 2022 05:4612,716169,643,960105,542,11302,273,280
2Jan 10, 2022 05:4612,721167,434,007105,580,46002,281,472
3Jan 10, 2022 05:4612,964183,155,515107,605,22902,273,280