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 listJul 25, 2022 17:26Yuriy LyfenkoYuriy LyfenkoScore: 15,049Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 25, 2022 17:2614,566190,941,594120,896,11402,306,048
2Jul 25, 2022 17:2614,566173,259,636120,901,23502,252,800
3Jul 25, 2022 17:2614,611177,507,714121,275,00302,265,088
4Jul 25, 2022 17:2615,016152,789,530121,643,0002,991,0002,449,408
5Jul 25, 2022 17:2615,034157,987,310123,782,000998,0002,469,888
6Jul 25, 2022 17:2615,034153,607,434121,789,0002,994,0002,478,080
7Jul 25, 2022 17:2615,049146,775,150122,911,0001,998,0002,297,856
8Jul 25, 2022 17:2615,054146,695,298121,954,0002,998,0002,379,776
9Jul 25, 2022 17:2615,059146,644,288122,989,0001,999,0002,383,872
10Jul 25, 2022 17:2615,060149,251,896122,000,0003,000,0002,359,296
11Jul 25, 2022 17:2615,066149,736,827123,047,0002,000,0002,359,296
12Jul 25, 2022 17:2615,078148,905,185123,142,0002,002,0002,387,968