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 10, 2024 08:41Matt StuchlikMatt StuchlikScore: 20,679Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 10, 2024 08:4120,435195,179,220168,609,0001,003,0002,285,568
2Apr 10, 2024 08:4120,437195,688,884168,624,0001,003,0002,285,568
3Apr 10, 2024 08:4120,542199,216,764169,493,0001,002,0002,265,088
4Apr 10, 2024 08:4120,656198,878,364170,443,0001,002,0002,269,184
5Apr 10, 2024 08:4120,663202,805,372170,502,0001,002,0002,265,088
6Apr 10, 2024 08:4120,675204,028,792170,600,0001,003,0002,277,376
7Apr 10, 2024 08:4120,679200,935,487171,639,00002,277,376
8Apr 10, 2024 08:4120,690195,270,079169,730,0001,996,0002,387,968
9Apr 10, 2024 08:4120,690199,929,297170,733,000998,0002,285,568
10Apr 10, 2024 08:4121,159238,667,797175,620,61602,289,664
11Apr 10, 2024 08:4121,842242,843,994181,288,66402,293,760
12Apr 10, 2024 08:4121,868261,456,858181,505,44202,285,568