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 listJan 27, 2023 12:40unsatcoreunsatcoreScore: 12,629Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 27, 2023 12:4011,499165,440,04295,440,18602,277,376
2Jan 27, 2023 12:4011,597165,109,05196,253,40402,281,472
3Jan 27, 2023 12:4011,874164,089,88098,557,70402,285,568
4Jan 27, 2023 12:4012,592136,042,928103,513,0001,004,0002,269,184
5Jan 27, 2023 12:4012,593132,052,799103,519,0001,005,0002,269,184
6Jan 27, 2023 12:4012,596130,968,356104,546,00002,269,184
7Jan 27, 2023 12:4012,629126,934,527101,824,0002,994,0002,527,232
8Jan 27, 2023 12:4012,641128,834,889103,920,000999,0002,269,184
9Jan 27, 2023 12:4012,658127,686,010102,057,0003,001,0002,531,328
10Jan 27, 2023 12:4012,703126,349,583105,438,00002,269,184
11Jan 27, 2023 12:4012,726132,991,462105,628,00002,269,184
12Jan 27, 2023 12:4012,775128,555,703103,030,0003,000,0002,531,328