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 1, 2023 03:39Yuriy LyfenkoYuriy LyfenkoScore: 368,170Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 1, 2023 03:39365,9663,097,436,3183,037,516,77802,293,760
2Dec 1, 2023 03:39368,1703,120,028,8763,055,807,62502,293,760
3Dec 1, 2023 03:39369,8703,148,575,8003,069,924,59402,281,472