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 06:36hype.ethhype.ethScore: 230,462Success
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 06:36230,4401,969,365,0571,912,653,03302,228,224
2Jan 10, 2024 06:36230,4621,979,363,0421,912,835,96202,236,416
3Jan 10, 2024 06:36230,7741,997,781,9681,915,425,09702,240,512