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 26, 2023 20:52Kevin HeaveyKevin HeaveyScore: 1,642,975Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2023 19:381,636,59113,644,327,16113,583,709,18402,256,896
2Jan 26, 2023 20:521,641,90313,680,913,94613,627,791,52102,256,896
3Jan 11, 2023 19:381,641,96013,683,883,21013,628,266,55902,252,800
4Jan 11, 2023 19:381,642,97513,707,574,42213,636,693,16502,240,512
5Jan 26, 2023 20:521,648,91913,766,389,81913,686,025,68302,248,704
6Jan 26, 2023 20:521,701,35214,203,128,86114,121,221,76102,256,896