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 27, 2023 10:29Oleg KovalovOleg KovalovScore: 1,631,671Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 27, 2023 10:291,631,44413,620,470,47613,540,982,62802,252,800
2Dec 27, 2023 10:291,631,67113,600,602,75213,542,870,68402,256,896
3Dec 27, 2023 10:291,698,23614,157,476,25114,095,355,33202,252,800