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, 2026 21:57javivallejojavivallejoScore: 58,440Success
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, 2026 21:5758,408514,503,309483,788,000999,0002,383,872
2Feb 2, 2026 21:5758,440521,330,924483,055,0002,000,0002,387,968
3Feb 2, 2026 21:5758,457519,196,950483,197,0002,000,0002,387,968