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 listSep 27, 2024 17:21Drew GarciaDrew GarciaScore: 66,358Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 27, 2024 17:2166,344578,885,846547,656,0002,998,0002,269,184
2Sep 27, 2024 17:2166,358581,810,672548,772,0001,999,0002,269,184
3Sep 27, 2024 17:2166,373577,799,441547,897,0002,999,0002,269,184