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 listDec 24, 2024 11:50Sean DewarSean DewarScore: 58,356Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 24, 2024 11:5058,329509,090,724482,131,0002,000,0002,289,664
2Dec 24, 2024 11:5058,334511,730,883482,175,0002,000,0002,289,664
3Dec 24, 2024 11:5058,337505,674,721483,201,0001,000,0002,277,376
4Dec 24, 2024 11:5058,353511,616,940483,333,0001,000,0002,289,664
5Dec 24, 2024 11:5058,356510,175,358484,353,00002,289,664
6Dec 24, 2024 11:5058,365513,955,471483,430,0001,000,0002,379,776
7Dec 24, 2024 11:5058,383510,571,611482,578,0001,998,0002,289,664
8Dec 24, 2024 11:5058,389512,855,329483,628,000999,0002,269,184
9Dec 24, 2024 11:5058,399514,264,107482,716,0001,998,0002,285,568