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:42hype.ethhype.ethScore: 580,111Success
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:42579,7924,867,505,7914,812,272,52502,232,320
2Jan 10, 2024 08:42580,1114,883,898,3284,814,921,22302,240,512
3Jan 10, 2024 08:42580,2084,869,700,5754,815,725,02402,236,416