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 listJun 15, 2022 03:000xNOY0xNOYScore: 431,018Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 15, 2022 03:00427,5623,608,763,3303,548,768,40402,191,360
2Jun 15, 2022 03:00431,0183,631,984,7893,577,451,84702,187,264
3Jun 15, 2022 03:00435,3493,679,614,7143,613,396,61102,191,360