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 30, 2025 20:32CCScore: 51,158Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2025 20:3251,132458,644,003424,399,00002,289,664
2Jun 30, 2025 20:3251,134455,991,261423,411,0001,000,0002,273,280
3Jun 30, 2025 20:3251,153454,464,603423,569,000998,0002,289,664
4Jun 30, 2025 20:3251,156450,070,174422,597,0001,998,0002,281,472
5Jun 30, 2025 20:3251,158450,858,655423,611,000999,0002,269,184
6Jun 30, 2025 20:3251,159451,779,424422,621,0001,998,0002,289,664
7Jun 30, 2025 20:3251,159456,148,175423,621,000999,0002,289,664
8Jun 30, 2025 20:3251,160448,186,206422,634,0001,998,0002,281,472
9Jun 30, 2025 20:3251,177452,326,962422,775,0001,998,0002,289,664