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 16:24Bubble BoiBubble BoiScore: 452,358Success
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 16:24452,0883,814,371,4773,752,326,73902,232,320
2Feb 2, 2024 16:21452,1983,804,755,7243,753,244,95402,240,512
3Feb 2, 2024 16:21452,2173,816,784,8783,753,403,19802,248,704
4Feb 2, 2024 16:24452,3583,808,049,1483,754,572,45102,256,896
5Feb 2, 2024 16:24454,4323,841,804,7573,771,782,73902,244,608
6Feb 2, 2024 16:21456,2973,851,746,1283,787,261,80702,256,896