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:16Bubble BoiBubble BoiScore: 57,786Success
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:1657,675540,268,275478,702,25702,244,608
2Feb 2, 2024 18:1657,786565,513,051479,622,85102,232,320
3Feb 2, 2024 18:1658,178543,759,275482,878,92602,244,608