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 listJan 12, 2024 16:41AxmAxmScore: 242,763Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2024 16:41242,6252,072,749,6612,013,789,59902,236,416
2Jan 12, 2024 16:41242,7632,076,931,4882,014,933,57502,240,512
3Jan 12, 2024 16:41242,7802,081,758,8832,015,077,39602,236,416