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 21, 2024 08:26mahdi739mahdi739Score: 403,303Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 21, 2024 08:26402,3783,371,412,8853,275,765,00063,975,0002,281,472
2Dec 21, 2024 08:26402,6993,372,647,0833,271,433,00070,966,0002,289,664
3Dec 21, 2024 08:26402,8593,373,579,0503,272,781,00070,951,0002,281,472
4Dec 21, 2024 08:26402,9003,376,719,0973,275,113,00068,960,0002,281,472
5Dec 21, 2024 08:26403,3033,376,092,9843,278,448,00068,967,0002,281,472
6Dec 21, 2024 08:26403,8163,377,326,9993,293,693,00057,977,0002,285,568
7Dec 21, 2024 08:26403,8253,378,126,8033,286,788,00064,956,0002,285,568
8Dec 21, 2024 08:26403,8443,380,905,2233,289,946,00061,961,0002,281,472
9Dec 21, 2024 08:26404,3323,383,346,3213,280,983,00074,976,0002,285,568