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 13, 2025 04:49Ian MckibbenIan MckibbenScore: 721,629Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 13, 2025 04:49721,5336,027,844,1435,695,839,000292,888,0002,404,352
2Jan 13, 2025 04:49721,6296,033,032,9015,686,645,000302,874,0002,400,256
3Jan 13, 2025 04:49722,7506,037,871,4935,699,087,000299,741,0002,420,736