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 12, 2024 13:56Kirill AndriianovKirill AndriianovScore: 73,048Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 12, 2024 13:5673,021628,887,510603,076,0003,000,0002,482,176
2Nov 12, 2024 13:5673,025628,020,742605,106,0001,000,0002,527,232
3Nov 12, 2024 13:5673,034630,308,578606,186,00002,527,232
4Nov 12, 2024 13:5673,047625,546,153604,294,0001,997,0002,482,176
5Nov 12, 2024 13:5673,048625,830,182605,302,0001,000,0002,535,424
6Nov 12, 2024 13:5673,049644,808,520605,303,0001,000,0002,527,232
7Nov 12, 2024 13:5673,061631,202,571606,406,00002,478,080
8Nov 12, 2024 13:5673,069633,457,091606,469,00002,478,080
9Nov 12, 2024 13:5673,083635,733,191605,590,000999,0002,531,328