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 7, 2025 05:33limanjun99limanjun99Score: 51,956Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2025 05:3351,891457,657,218359,743,00070,949,0002,371,584
2Jun 7, 2025 05:3351,900460,401,649370,799,00059,967,0002,371,584
3Jun 7, 2025 05:3351,902454,379,845369,818,00060,970,0002,494,464
4Jun 7, 2025 05:3351,942453,496,933362,100,00069,019,0002,379,776
5Jun 7, 2025 05:3351,956456,135,284352,195,00079,043,0002,379,776
6Jun 7, 2025 05:3351,959452,694,908365,222,00066,040,0002,510,848
7Jun 7, 2025 05:3352,009456,037,936366,725,00064,951,0002,260,992
8Jun 7, 2025 05:3352,037456,810,384369,919,00061,986,0002,379,776
9Jun 7, 2025 05:3352,462461,828,466369,370,00066,066,0002,510,848