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, 2023 01:22Kevin HeaveyKevin HeaveyScore: 56,972Success
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, 2023 01:2356,941541,390,827472,610,78502,228,224
2Jan 12, 2023 01:2356,963539,238,135472,791,08302,236,416
3Jan 12, 2023 01:2256,966538,989,355472,813,87002,224,128
4Jan 12, 2023 01:2356,972534,439,731472,864,60202,228,224
5Jan 12, 2023 01:2256,986538,978,729472,984,85302,220,032
6Jan 12, 2023 01:2257,015543,567,621473,220,70702,224,128