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:55izotoffizotoffScore: 178,709Success
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:55178,4971,509,677,9271,401,548,00079,974,0002,326,528
2Nov 8, 2025 21:55178,6251,507,288,1411,403,611,00078,978,0002,326,528
3Nov 8, 2025 21:55178,6491,509,325,0911,402,851,00079,934,0002,326,528
4Nov 8, 2025 21:55178,6801,514,892,5981,400,097,00082,946,0002,326,528
5Nov 8, 2025 21:55178,7091,508,369,6511,401,325,00081,960,0002,449,408
6Nov 8, 2025 21:55179,0351,515,304,7931,403,050,00082,943,0002,326,528
7Nov 8, 2025 21:55180,9931,531,295,6911,416,288,00085,956,0002,326,528
8Nov 8, 2025 21:55181,1261,530,508,4721,416,383,00086,962,0002,449,408
9Nov 8, 2025 21:55182,7111,542,402,1041,438,529,00077,974,0002,387,968