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 28, 2024 12:24NeoNeoScore: 78,263Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 28, 2024 12:2478,260676,111,004647,562,0001,998,0002,277,376
2Dec 28, 2024 12:2478,263672,760,050647,584,0001,998,0002,269,184
3Dec 28, 2024 12:2478,271671,945,263647,654,0001,998,0002,269,184