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 15:46Bubble BoiBubble BoiScore: 55,397Success
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 15:4655,362526,271,014459,507,82802,260,992
2Feb 13, 2024 15:4655,397526,157,384459,792,57402,256,896
3Feb 13, 2024 15:4655,433519,875,976460,093,95102,256,896