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 21, 2026 22:50wnwnScore: 5,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 21, 2026 22:505,01364,284,21340,595,0001,014,0002,478,080
2Feb 21, 2026 22:505,03970,373,12340,827,000995,0002,494,464
3Feb 21, 2026 22:505,03964,691,15039,831,0001,991,0002,535,424