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 listFeb 16, 2024 11:16Huy Duc LeHuy Duc LeScore: 13,519Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2024 11:1613,498138,999,233110,037,0002,000,0002,269,184
2Feb 16, 2024 11:1613,507143,462,633111,111,0001,001,0002,273,280
3Feb 16, 2024 11:1613,513136,473,800110,157,0002,002,0002,285,568
4Feb 16, 2024 11:1613,514148,334,167110,161,0002,002,0002,285,568
5Feb 16, 2024 11:1613,517142,264,196110,186,0002,003,0002,277,376
6Feb 16, 2024 11:1613,519139,055,331110,208,0002,003,0002,260,992
7Feb 16, 2024 11:1613,519138,384,189110,208,0002,003,0002,285,568
8Feb 16, 2024 11:1613,520141,014,021110,216,0002,003,0002,527,232
9Feb 16, 2024 11:1613,900139,835,597114,366,0001,003,0002,277,376
10Feb 16, 2024 11:1613,914179,776,641115,487,14502,293,760
11Feb 16, 2024 11:1613,961191,511,276115,880,03102,289,664
12Feb 16, 2024 11:1613,968179,612,151115,932,61502,297,856