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 listDec 2, 2023 20:08Yuriy LyfenkoYuriy LyfenkoScore: 79,412Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 2, 2023 20:0879,389722,723,046658,928,02602,248,704
2Dec 2, 2023 20:0879,412729,630,699659,120,64002,244,608
3Dec 2, 2023 20:0879,424730,070,954659,219,16202,236,416