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 18, 2023 11:40unsatcoreunsatcoreScore: 12,903Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 18, 2023 11:4012,692127,654,323105,342,00002,519,040
2Jan 18, 2023 11:4012,716131,746,661102,530,0003,015,0002,269,184
3Jan 18, 2023 11:4012,743130,463,799103,769,0001,995,0002,531,328
4Jan 18, 2023 11:4012,891130,776,871104,993,0001,999,0002,510,848
5Jan 18, 2023 11:4012,893130,987,500105,014,0002,000,0002,269,184
6Jan 18, 2023 11:4012,900131,149,909105,073,0002,001,0002,269,184
7Jan 18, 2023 11:4012,903130,682,590103,092,0004,003,0002,269,184
8Jan 18, 2023 11:4012,907128,499,313104,121,0003,003,0002,375,680
9Jan 18, 2023 11:4012,921135,079,186105,242,0002,004,0002,523,136
10Jan 18, 2023 11:4013,039179,369,047108,219,90502,277,376
11Jan 18, 2023 11:4013,041173,328,136108,242,47602,273,280
12Jan 18, 2023 11:4013,052165,587,327108,327,82202,281,472