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:03CCScore: 54,017Success
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:0353,988470,530,155446,102,0002,000,0002,269,184
2Jun 30, 2025 20:0354,012475,821,753447,297,0001,000,0002,265,088
3Jun 30, 2025 20:0354,014475,675,226447,316,0001,000,0002,289,664
4Jun 30, 2025 20:0354,015472,745,935447,321,0001,000,0002,277,376
5Jun 30, 2025 20:0354,017468,453,082447,340,0001,000,0002,379,776
6Jun 30, 2025 20:0354,019476,965,243448,360,00002,289,664
7Jun 30, 2025 20:0354,032479,469,554447,461,0001,001,0002,269,184
8Jun 30, 2025 20:0354,033479,498,222446,478,0001,997,0002,289,664
9Jun 30, 2025 20:0354,047478,293,339447,590,000999,0002,269,184