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 listFeb 10, 2024 21:40Bubble BoiBubble BoiScore: 54,717Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 10, 2024 21:4054,690509,106,318453,927,52502,240,512
2Feb 10, 2024 21:4054,717510,799,441454,152,74502,228,224
3Feb 10, 2024 21:4054,723520,641,018454,202,10402,236,416