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 08:49unsatcoreunsatcoreScore: 12,415Success
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 08:4911,841159,959,23498,280,59102,277,376
2Jan 27, 2023 08:4911,870170,226,86598,523,53602,269,184
3Jan 27, 2023 08:4911,928163,437,07398,998,38202,281,472
4Jan 27, 2023 08:4912,330128,956,11599,327,0003,009,0002,269,184
5Jan 27, 2023 08:4912,386129,781,78899,807,0002,994,0002,269,184
6Jan 27, 2023 08:4912,410124,142,980100,000,0003,000,0002,265,088
7Jan 27, 2023 08:4912,415125,255,340102,047,0001,000,0002,269,184
8Jan 27, 2023 08:4912,424123,674,153101,116,0002,002,0002,269,184
9Jan 27, 2023 08:4912,465128,363,061102,459,0001,004,0002,527,232
10Jan 27, 2023 08:4912,505133,921,403102,794,000998,0002,531,328
11Jan 27, 2023 08:4912,507126,237,274101,810,0001,996,0002,359,296
12Jan 27, 2023 08:4912,520128,128,878102,914,000999,0002,269,184