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 16, 2026 18:47wnwnScore: 8,521Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2026 18:478,47692,762,59766,329,0004,019,0002,396,160
2Feb 16, 2026 18:478,521102,115,57666,744,0003,984,0002,400,256
3Feb 16, 2026 18:478,618106,490,52368,504,0003,022,0002,445,312