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 17:12Bubble BoiBubble BoiScore: 66,453Success
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 17:1266,302608,968,548550,307,31402,236,416
2Feb 2, 2024 17:1266,453628,876,963551,561,15302,244,608
3Feb 2, 2024 17:1266,545633,179,741552,319,68902,244,608