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, 2025 22:03NeoNeoScore: 55,437Success
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, 2025 22:0355,198486,487,991285,089,000173,054,0002,494,464
2Feb 10, 2025 22:0355,437494,454,764283,078,000177,049,0002,269,184
3Feb 10, 2025 22:0356,796499,778,429295,626,000175,777,0002,461,696