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 listApr 14, 2024 12:53E SequeiraE SequeiraScore: 19,381Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 14, 2024 12:5319,370225,840,825160,767,99102,228,224
2Apr 14, 2024 12:5519,372226,748,889160,788,19302,232,320
3Apr 14, 2024 12:5619,373226,934,983160,796,90502,232,320
4Apr 14, 2024 12:5519,378217,360,563160,834,65402,236,416
5Apr 14, 2024 12:5519,378221,483,575160,836,87702,228,224
6Apr 14, 2024 12:5519,380215,549,503160,855,03202,232,320
7Apr 14, 2024 12:5519,381213,456,037160,862,92902,228,224
8Apr 14, 2024 12:5619,390216,572,780160,934,20702,236,416
9Apr 14, 2024 12:5519,395227,068,507160,980,86002,232,320
10Apr 14, 2024 12:5619,445225,096,927161,392,27402,220,032
11Apr 14, 2024 12:5319,581230,202,295162,519,32602,232,320
12Apr 14, 2024 12:5319,586223,579,293162,562,04002,252,800