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 listApr 14, 2024 10:43Matt StuchlikMatt StuchlikScore: 15,613Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 14, 2024 10:4315,600156,208,071128,480,0001,003,0002,531,328
2Apr 14, 2024 10:4315,600159,141,686127,489,0001,992,0002,285,568
3Apr 14, 2024 10:4315,601151,554,698128,482,0001,003,0002,273,280
4Apr 14, 2024 10:4315,608155,816,636128,544,0001,004,0002,277,376
5Apr 14, 2024 10:4315,609155,513,254128,548,0001,004,0002,367,488
6Apr 14, 2024 10:4315,612156,587,688128,576,0001,004,0002,285,568
7Apr 14, 2024 10:4315,613161,228,871128,580,0001,004,0002,277,376
8Apr 14, 2024 10:4315,622156,661,648128,668,000997,0002,285,568
9Apr 14, 2024 10:4315,780156,635,402128,978,0001,999,0002,531,328
10Apr 14, 2024 10:4319,481223,539,756161,690,03302,301,952
11Apr 14, 2024 10:4319,486224,137,874161,733,87302,289,664
12Apr 14, 2024 10:4319,488225,746,456161,751,80002,301,952