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 00:57Kevin HeaveyKevin HeaveyScore: 52,847Success
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 00:5752,834498,758,580438,522,81602,224,128
2Jan 12, 2023 00:5752,840510,144,993438,569,45002,232,320
3Jan 12, 2023 00:5752,847499,921,049438,629,87102,220,032
4Jan 12, 2023 00:5752,847527,278,361438,633,49502,228,224
5Jan 12, 2023 00:5752,847507,248,021438,626,30002,220,032
6Jan 12, 2023 00:5752,870511,733,823438,818,55602,228,224