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 20, 2026 13:58wnwnScore: 5,641Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 20, 2026 13:585,58772,910,09645,365,0001,008,0002,478,080
2Feb 20, 2026 13:585,64179,668,64144,828,0001,992,0002,490,368
3Feb 20, 2026 13:585,64873,676,71044,885,0001,994,0002,281,472