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 10, 2024 08:47hype.ethhype.ethScore: 580,317Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 10, 2024 08:47580,0474,874,896,0364,814,391,74002,240,512
2Jan 10, 2024 08:47580,3174,878,144,2164,816,627,40702,244,608
3Jan 10, 2024 08:47580,4144,881,744,6344,817,440,23102,240,512