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 22, 2024 07:46Christopher MullinsChristopher MullinsScore: 143,537Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2024 07:46143,4631,220,039,0801,189,744,000999,0002,322,432
2Dec 22, 2024 07:46143,5371,220,159,7351,188,355,0002,998,0002,478,080
3Dec 22, 2024 07:46143,7031,219,066,2381,189,737,0002,996,0002,342,912