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 13, 2024 17:46Bubble BoiBubble BoiScore: 51,514Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 13, 2024 17:4651,434497,619,177426,903,36302,228,224
2Feb 13, 2024 17:4651,514487,903,126427,562,83402,252,800
3Feb 13, 2024 17:4651,562502,442,263427,960,86602,244,608