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 listNov 8, 2025 21:22izotoffizotoffScore: 194,738Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 8, 2025 21:22194,3701,636,098,8771,555,300,00057,973,0002,326,528
2Nov 8, 2025 21:22194,5631,645,284,7331,553,912,00060,957,0002,326,528
3Nov 8, 2025 21:22194,6611,644,391,0341,554,699,00060,988,0002,326,528
4Nov 8, 2025 21:22194,7241,647,148,0511,558,236,00057,971,0002,326,528
5Nov 8, 2025 21:22194,7381,643,526,4191,560,351,00055,976,0002,453,504
6Nov 8, 2025 21:22194,8021,651,788,1611,549,908,00066,952,0002,326,528
7Nov 8, 2025 21:22194,8091,638,497,5351,560,956,00055,962,0002,326,528
8Nov 8, 2025 21:22194,9341,644,037,2681,550,998,00066,956,0002,326,528
9Nov 8, 2025 21:22195,0971,644,549,0181,557,329,00061,973,0002,326,528