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 28, 2024 18:31Aryan JainAryan JainScore: 406,044Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 28, 2024 18:31404,3103,380,913,9373,283,800,00071,973,0002,281,472
2Dec 28, 2024 18:31404,6683,385,284,7523,297,771,00060,977,0002,281,472
3Dec 28, 2024 18:31404,7613,385,717,5733,264,560,00094,958,0002,281,472
4Dec 28, 2024 18:31404,8363,384,557,4513,292,174,00067,962,0002,285,568
5Dec 28, 2024 18:31406,0443,396,183,6623,285,210,00084,953,0002,510,848
6Dec 28, 2024 18:31406,1653,392,481,2943,319,195,00051,971,0002,281,472
7Dec 28, 2024 18:31406,1973,398,843,7173,312,467,00058,972,0002,347,008
8Dec 28, 2024 18:31409,2203,418,152,4713,316,558,00079,965,0002,371,584
9Dec 28, 2024 18:31415,9253,481,743,4303,373,218,00078,958,0002,293,760