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 7, 2024 14:10Evgeniy AsvatovEvgeniy AsvatovScore: 339,736Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 7, 2024 14:10339,5622,888,070,1542,818,364,09602,260,992
2Jan 7, 2024 14:10339,7362,900,637,6452,819,805,70302,195,456
3Jan 7, 2024 14:10340,1122,889,760,6372,822,932,80202,199,552