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 15, 2026 17:11wnwnScore: 88,492Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 17:1188,410760,400,149724,808,0008,997,0002,531,328
2Feb 15, 2026 17:1188,492763,359,177727,492,0006,995,0002,514,944
3Feb 15, 2026 17:1188,707770,105,131728,263,0008,002,0002,461,696