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 2, 2024 18:54Bubble BoiBubble BoiScore: 58,033Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 2, 2024 18:5457,835557,268,357480,027,04202,244,608
2Feb 2, 2024 18:5458,033544,720,496481,677,45602,236,416
3Feb 2, 2024 18:5458,070541,096,787481,981,76102,252,800