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 12, 2024 17:45AxmAxmScore: 167,325Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2024 17:45167,0511,441,204,4321,386,522,32702,244,608
2Jan 12, 2024 17:45167,3251,459,833,7751,388,798,03702,232,320
3Jan 12, 2024 17:45167,9221,448,713,6041,393,756,46902,240,512