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 listFeb 23, 2023 20:10Unays Unays Score: 453,713Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 23, 2023 20:10453,5903,826,177,6673,764,798,49602,232,320
2Feb 23, 2023 20:10453,7133,825,375,3443,765,817,93102,228,224
3Feb 23, 2023 20:10453,8473,832,446,2813,766,931,57402,240,512