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 listOct 9, 2024 01:53yousef200509yousef200509Score: 265,250Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2024 01:53265,0122,229,784,2932,104,664,00094,939,0002,326,528
2Oct 9, 2024 01:53265,0252,224,164,3792,114,760,00084,950,0002,482,176
3Oct 9, 2024 01:53265,0632,224,260,2732,100,065,00099,955,0002,486,272
4Oct 9, 2024 01:53265,2462,231,731,1642,096,563,000104,978,0002,486,272
5Oct 9, 2024 01:53265,2502,232,414,1352,089,599,000111,978,0002,326,528
6Oct 9, 2024 01:53265,2522,232,921,0542,105,654,00095,938,0002,326,528
7Oct 9, 2024 01:53265,2742,231,615,5982,104,829,00096,946,0002,330,624
8Oct 9, 2024 01:53265,3342,231,525,7902,107,304,00094,968,0002,326,528
9Oct 9, 2024 01:53265,3522,229,958,4252,106,492,00095,931,0002,482,176