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 11, 2024 00:39zielajzielajScore: 6,396Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2024 00:396,27073,589,65751,044,0001,000,0002,273,280
2Nov 11, 2024 00:396,27372,903,68551,067,0001,001,0002,535,424
3Nov 11, 2024 00:396,27573,638,03150,076,0002,003,0002,535,424
4Nov 11, 2024 00:396,27778,808,50650,096,0002,003,0002,424,832
5Nov 11, 2024 00:396,29676,601,09551,252,0001,004,0002,428,928
6Nov 11, 2024 00:396,30176,256,41350,284,0002,011,0002,535,424
7Nov 11, 2024 00:396,39676,302,75951,080,0002,003,0002,433,024
8Nov 11, 2024 00:396,55379,168,02553,385,0001,007,0002,428,928
9Nov 11, 2024 00:396,81787,175,38556,582,00002,273,280
10Nov 11, 2024 00:397,53991,953,18262,570,00002,269,184
11Nov 11, 2024 00:397,54486,931,13962,615,00002,433,024
12Nov 11, 2024 00:397,70888,187,18663,980,00002,531,328