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 10, 2024 22:07Bubble BoiBubble BoiScore: 55,889Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 10, 2024 22:0755,792520,383,078463,074,30902,228,224
2Feb 10, 2024 22:0755,889527,799,754463,881,86602,224,128
3Feb 10, 2024 22:0755,948526,963,420464,370,71802,240,512