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 listJun 8, 2025 09:28limanjun99limanjun99Score: 43,505Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2025 09:2843,486389,203,070357,936,0002,999,0002,269,184
2Jun 8, 2025 09:2843,488388,052,210358,954,0001,999,0002,392,064
3Jun 8, 2025 09:2843,489382,542,564358,957,0001,999,0002,269,184
4Jun 8, 2025 09:2843,498386,099,472359,032,0002,000,0002,400,256
5Jun 8, 2025 09:2843,505382,185,894358,093,0003,000,0002,269,184
6Jun 8, 2025 09:2843,511386,944,626361,144,00002,281,472
7Jun 8, 2025 09:2843,521381,561,043360,228,0001,000,0002,269,184
8Jun 8, 2025 09:2843,523384,214,706360,241,0001,000,0002,404,352
9Jun 8, 2025 09:2843,525384,736,227361,254,00002,396,160