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 12, 2024 19:43Bubble BoiBubble BoiScore: 54,735Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 12, 2024 19:4354,672518,848,904453,779,35602,252,800
2Feb 12, 2024 19:4354,735512,046,489454,298,03802,240,512
3Feb 12, 2024 19:4354,741509,626,925454,349,75602,240,512