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 31, 2023 11:23unsatcoreunsatcoreScore: 13,324Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 31, 2023 11:2313,282133,858,934108,237,0002,004,0002,277,376
2Jan 31, 2023 11:2313,285131,068,407108,262,0002,004,0002,277,376
3Jan 31, 2023 11:2313,300144,611,178109,385,0001,003,0002,277,376
4Jan 31, 2023 11:2313,302138,596,157109,406,0001,003,0002,277,376
5Jan 31, 2023 11:2313,304133,619,525109,419,0001,003,0002,531,328
6Jan 31, 2023 11:2313,310140,675,081109,465,0001,004,0002,277,376
7Jan 31, 2023 11:2313,324136,532,432109,585,0001,005,0002,277,376
8Jan 31, 2023 11:2313,345142,851,881108,766,0001,995,0002,265,088
9Jan 31, 2023 11:2313,384133,942,443109,090,0002,001,0002,277,376
10Jan 31, 2023 11:2313,731185,295,210113,964,95002,285,568
11Jan 31, 2023 11:2313,736166,597,830114,007,17402,273,280
12Jan 31, 2023 11:2313,739173,681,927114,037,07602,265,088