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 15:24unsatcoreunsatcoreScore: 11,194Success
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 15:2411,182114,427,62791,804,0001,008,0002,277,376
2Jan 31, 2023 15:2411,187115,393,19890,856,0001,996,0002,277,376
3Jan 31, 2023 15:2411,188121,717,78690,863,0001,996,0002,260,992
4Jan 31, 2023 15:2411,188127,137,07190,864,0001,997,0002,277,376
5Jan 31, 2023 15:2411,189122,567,41690,875,0001,997,0002,523,136
6Jan 31, 2023 15:2411,192118,250,45590,896,0001,997,0002,277,376
7Jan 31, 2023 15:2411,194115,047,67290,914,0001,998,0002,277,376
8Jan 31, 2023 15:2411,198120,042,49390,944,0001,998,0002,260,992
9Jan 31, 2023 15:2411,207120,961,43690,018,0003,000,0002,277,376
10Jan 31, 2023 15:2412,744157,762,403105,771,42602,281,472
11Jan 31, 2023 15:2412,761167,449,408105,919,08702,277,376
12Jan 31, 2023 15:2412,805179,730,748106,284,32602,252,800