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 17, 2023 09:33unsatcoreunsatcoreScore: 19,269Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 17, 2023 09:3318,813175,825,397154,150,0002,001,0002,514,944
2Jan 17, 2023 09:3319,032229,813,592157,968,16202,281,472
3Jan 17, 2023 09:3319,148182,686,181156,928,0001,999,0002,523,136
4Jan 17, 2023 09:3319,251183,868,549156,789,0002,995,0002,277,376
5Jan 17, 2023 09:3319,256187,954,363156,827,0002,996,0002,277,376
6Jan 17, 2023 09:3319,266183,313,292157,906,0001,998,0002,277,376
7Jan 17, 2023 09:3319,269183,050,636156,934,0002,998,0002,519,040
8Jan 17, 2023 09:3319,274187,304,129157,973,0001,999,0002,277,376
9Jan 17, 2023 09:3319,283184,664,158159,047,0001,000,0002,375,680
10Jan 17, 2023 09:3319,287183,566,496158,084,0002,001,0002,277,376
11Jan 17, 2023 09:3319,548234,108,841162,246,35402,273,280
12Jan 17, 2023 09:3319,605246,809,765162,718,87402,277,376