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 16, 2022 22:51Yuriy LyfenkoYuriy LyfenkoScore: 30,723Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 16, 2022 22:5130,717319,486,055254,952,69502,207,744
2Jan 17, 2022 00:0830,720327,341,203254,973,01802,211,840
3Jan 16, 2022 22:5130,722327,863,001254,992,30202,211,840
4Jan 17, 2022 00:0830,722321,518,732254,989,17802,224,128
5Jan 16, 2022 22:5130,723331,235,171254,999,01902,211,840
6Jan 16, 2022 22:5130,726315,019,229255,026,21702,211,840
7Jan 17, 2022 00:0830,727345,441,072255,036,43402,215,936
8Jan 16, 2022 22:5130,730317,294,909255,058,92802,220,032
9Jan 16, 2022 22:5130,731331,838,235255,065,96702,220,032