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 26, 2023 13:30unsatcoreunsatcoreScore: 12,600Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 26, 2023 13:3011,719152,182,54397,267,33602,289,664
2Jan 26, 2023 13:3011,930173,148,76799,022,38102,273,280
3Jan 26, 2023 13:3011,941167,543,62399,107,83502,281,472
4Jan 26, 2023 13:3012,576130,629,517102,375,0002,007,0002,277,376
5Jan 26, 2023 13:3012,583127,965,146103,433,0001,004,0002,277,376
6Jan 26, 2023 13:3012,597130,678,522104,556,00002,523,136
7Jan 26, 2023 13:3012,600131,651,283102,567,0002,011,0002,277,376
8Jan 26, 2023 13:3012,628129,906,89099,819,0004,990,0002,277,376
9Jan 26, 2023 13:3012,639126,141,101101,904,0002,997,0002,363,392
10Jan 26, 2023 13:3012,644140,625,959102,945,0001,998,0002,514,944
11Jan 26, 2023 13:3012,669137,424,182104,153,0001,001,0002,527,232
12Jan 26, 2023 13:3012,671128,313,650103,166,0002,003,0002,265,088