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 19, 2024 18:08Javid izadiJavid izadiScore: 398,553Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 19, 2024 18:08393,5173,293,336,7733,203,229,00062,965,0002,281,472
2Dec 19, 2024 18:08398,5533,338,293,7673,238,034,00069,957,0002,285,568
3Dec 19, 2024 18:08399,2913,339,440,9333,263,148,00050,971,0002,281,472