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 listOct 8, 2023 20:33sliceteamsliceteamScore: 15,831Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 8, 2023 20:3315,125198,366,924125,533,57002,277,376
2Oct 8, 2023 20:3315,424196,154,253128,021,36802,273,280
3Oct 8, 2023 20:3315,499199,519,049128,644,29602,269,184
4Oct 8, 2023 20:3315,717159,596,465129,451,0001,003,0002,260,992
5Oct 8, 2023 20:3315,760157,787,589130,806,00002,260,992
6Oct 8, 2023 20:3315,807160,347,102129,195,0002,003,0002,260,992
7Oct 8, 2023 20:3315,831161,939,276129,395,0002,006,0002,383,872
8Oct 8, 2023 20:3315,845154,219,261130,514,0001,003,0002,387,968
9Oct 8, 2023 20:3315,859155,081,801130,623,0001,004,0002,383,872
10Oct 8, 2023 20:3315,878160,403,276129,795,0001,996,0002,260,992
11Oct 8, 2023 20:3315,881161,115,628130,815,000998,0002,260,992
12Oct 8, 2023 20:3316,111159,850,105131,723,0001,995,0002,379,776