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 17, 2024 17:18LevshaVLevshaVScore: 264,159Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 17, 2024 17:18263,8122,216,474,1982,091,697,00097,939,0002,326,528
2Nov 17, 2024 17:18263,8242,216,871,8642,084,801,000104,939,0002,338,816
3Nov 17, 2024 17:18263,9322,218,274,2212,098,694,00091,942,0002,330,624
4Nov 17, 2024 17:18264,1032,222,746,4802,105,093,00086,962,0002,326,528
5Nov 17, 2024 17:18264,1592,223,094,2892,109,575,00082,943,0002,326,528
6Nov 17, 2024 17:18264,2072,221,358,9262,096,969,00095,952,0002,326,528
7Nov 17, 2024 17:18264,2102,219,241,0472,099,984,00092,955,0002,326,528
8Nov 17, 2024 17:18264,3182,218,699,3692,080,897,000112,940,0002,326,528
9Nov 17, 2024 17:18264,3722,216,422,7622,097,323,00096,968,0002,326,528