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 listDec 25, 2024 07:31Javid izadiJavid izadiScore: 71,672Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 25, 2024 07:3171,368615,072,091417,547,000174,810,0002,519,040
2Dec 25, 2024 07:3171,622618,203,254418,620,000175,840,0002,285,568
3Dec 25, 2024 07:3171,634619,635,905418,694,000175,871,0002,342,912
4Dec 25, 2024 07:3171,671621,332,458419,906,000174,961,0002,342,912
5Dec 25, 2024 07:3171,672622,441,811419,916,000174,965,0002,301,952
6Dec 25, 2024 07:3171,683622,851,556418,981,000175,992,0002,404,352
7Dec 25, 2024 07:3171,719620,652,495417,484,000177,780,0002,293,760
8Dec 25, 2024 07:3171,747621,778,598419,646,000175,851,0002,285,568
9Dec 25, 2024 07:3171,759620,702,533418,719,000176,881,0002,510,848