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:38unsatcoreunsatcoreScore: 12,943Success
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:3811,826162,397,90798,155,85202,281,472
2Jan 18, 2023 11:3811,843153,111,67498,300,31502,281,472
3Jan 18, 2023 11:3812,102152,033,575100,447,34402,277,376
4Jan 18, 2023 11:3812,705127,980,858104,444,0001,004,0002,281,472
5Jan 18, 2023 11:3812,928137,589,374106,303,0001,002,0002,269,184
6Jan 18, 2023 11:3812,942132,520,874106,419,0001,003,0002,523,136
7Jan 18, 2023 11:3812,943134,603,465106,420,0001,003,0002,514,944
8Jan 18, 2023 11:3812,951133,113,304107,496,00002,523,136
9Jan 18, 2023 11:3812,958138,490,434106,548,0001,005,0002,277,376
10Jan 18, 2023 11:3812,961133,372,312106,570,0001,005,0002,277,376
11Jan 18, 2023 11:3812,983140,085,948104,768,0002,993,0002,277,376
12Jan 18, 2023 11:3812,985137,840,741106,782,000997,0002,514,944