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 6, 2025 10:07E SequeiraE SequeiraScore: 108,039Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 6, 2025 10:07107,998926,826,551835,425,00060,958,0002,461,696
2Feb 6, 2025 10:07108,039923,351,276831,741,00064,979,0002,330,624
3Feb 6, 2025 10:07108,220921,683,318832,281,00065,943,0002,469,888