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 18, 2023 02:55Aaron LoviAaron LoviScore: 76,210Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2023 03:0076,175702,122,243632,252,54602,285,568
2Apr 18, 2023 03:0276,176712,728,028632,257,41102,277,376
3Apr 18, 2023 03:0276,201705,010,021632,467,99002,293,760
4Apr 18, 2023 03:0276,206689,765,880632,509,25002,277,376
5Apr 18, 2023 02:5576,210689,117,455632,546,51202,285,568
6Apr 18, 2023 03:0076,222688,577,450632,643,69902,281,472
7Apr 18, 2023 02:5576,241692,156,770632,797,97502,285,568
8Apr 18, 2023 03:0076,269694,971,724633,033,10902,289,664
9Apr 18, 2023 02:5576,298686,870,936633,269,31002,277,376