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 listMar 4, 2025 22:47Aniruddha DebAniruddha DebScore: 9,231Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2025 22:479,219104,282,36972,492,0004,027,0002,322,432
2Mar 4, 2025 22:479,221106,418,16773,512,0003,021,0002,383,872
3Mar 4, 2025 22:479,22299,558,51972,511,0004,028,0002,478,080
4Mar 4, 2025 22:479,222100,941,58073,519,0003,021,0002,392,064
5Mar 4, 2025 22:479,231104,852,61072,582,0004,032,0002,367,488
6Mar 4, 2025 22:479,246105,103,52371,760,0004,983,0002,306,048
7Mar 4, 2025 22:479,251103,313,78672,796,0003,988,0002,330,624
8Mar 4, 2025 22:479,271106,014,22973,951,0002,998,0002,326,528
9Mar 4, 2025 22:479,283100,591,52972,048,0005,003,0002,342,912