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 listNov 15, 2024 13:16Uladzislau NestsiarukUladzislau NestsiarukScore: 497,965Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 15, 2024 13:16495,4744,144,313,6674,030,466,00081,968,0002,523,136
2Nov 15, 2024 13:16497,9654,163,943,8564,065,141,00067,968,0002,281,472
3Nov 15, 2024 13:16502,9244,209,601,6504,106,300,00067,971,0002,281,472