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 18, 2026 19:13wnwnScore: 7,202Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 19:137,11485,329,55358,046,0001,000,0002,359,296
2Feb 18, 2026 19:137,20283,459,61858,783,000996,0002,465,792
3Feb 18, 2026 19:137,21181,946,04955,864,0003,990,0002,469,888