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 listMay 27, 2024 15:49Matt StuchlikMatt StuchlikError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 27, 2024 15:4900000Error: Exit with code 1: Segmentation fault at address: 2416181376stderr
2May 27, 2024 15:5000000Error: Exit with code 1: Segmentation fault at address: 570491008stderr
3May 27, 2024 15:536,150119,714,94651,047,10002,207,744
4May 27, 2024 15:526,156116,946,48051,095,30202,187,264
5May 27, 2024 15:516,170115,758,25951,210,42602,195,456
6May 27, 2024 15:516,172114,829,41451,224,38102,203,648
7May 27, 2024 15:526,189110,888,13451,366,17102,187,264
8May 27, 2024 15:536,220120,513,51051,629,84602,187,264
9May 27, 2024 15:526,222118,322,61151,644,43102,195,456
10May 27, 2024 15:516,297112,355,55552,263,08102,220,032
11May 27, 2024 15:536,337126,717,93752,601,13402,195,456